|0.2.6||Aug 3, 2020|
|0.2.5||Jul 31, 2020|
|0.1.0||Apr 25, 2020|
#176 in Algorithms
90 downloads per month
This is a pure Rust implementation of the PLONK proving system over BLS12-381
This code is highly experimental, use at your own risk.
This library contains a modularised implementation of KZG10 as the default polynomial commitment scheme.
There are two main types of documentation in this repository:
Crate documentation. This provides info about all of the functions that the library provides as well as the documentation regarding the data structures that it exports. To check it, please feel free to go to the documentation page
Notes. This is a specific subset of documentation which explains the mathematical key concepts of PLONK and how they work with mathematical demonstrations. It can be found inside of the documentation page in the notes sub-section
Benchmarks taken on
Intel(R) Core(TM) i5-7300HQ CPU @ 2.50GHz
For a proof-size of
- Proving time:
- Verification time:
6.13ms. (This time will not vary depending on the proof-size.)
- Reference implementation AztecProtocol/Barretenberg
- FFT Module and KZG10 Module were taken and modified from zexe/zcash and scipr-lab respectively.
This code is licensed under Mozilla Public License Version 2.0 (MPL-2.0). Please see LICENSE for further info.
Implementation designed by the dusk team.
- If you want to contribute to this repository/project please, check CONTRIBUTING.md
- If you want to report a bug or request a new feature addition, please open an issue on this repository.