Crates.io | dusk-plonk |
lib.rs | dusk-plonk |
version | 0.19.2 |
source | src |
created_at | 2020-04-25 15:51:41.76214 |
updated_at | 2024-03-27 10:01:43.845158 |
description | A pure-Rust implementation of the PLONK ZK-Proof algorithm |
homepage | |
repository | https://github.com/dusk-network/plonk |
max_upload_size | |
id | 233998 |
size | 619,056 |
This is a pure Rust implementation of the PLONK proving system over BLS12-381
This library contains a modularised implementation of KZG10 as the default polynomial commitment scheme.
DISCLAIMER: This library is currently unstable and still needs to go through an exhaustive security analysis. Use at your own risk.
Check the 'examples' directory for the usage.
This crate includes a variety of features which will briefly be explained below:
alloc
: Enables the usage of an allocator and with it the capability of performing Proof
constructions and
verifications. Without this feature it IS NOT possible to prove or verify anything.
Its absence only makes dusk-plonk
export certain fixed-size data structures such as Proof
which can be useful in no_std environments where we don't have allocators either.std
: Enables std
usage as well as rayon
parallelization in some proving and verifying ops.
It also uses the std
versions of the elliptic curve deps, which utilizes the parallel
feature
from dusk-bls12-381
. By default, this is the feature that comes enabled with the crate.debug
: Enables the runtime debugger backend. Will output CDF files to the path defined in the CDF_OUTPUT
environment variable. If used, the binary must be compiled with debug = true
. For more info, check the cargo book.
The recommended method is to derive the std output, and the std error, and then place them in text file
which can be used to efficiently analyse the gates.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 this, please feel free to go to
the documentation page or run make doc
or make doc-internal
.
Notes. This is a specific subset of documentation which explains the key mathematical concepts
of PLONK and how they work with mathematical demonstrations. To check it, run make doc
and open the resulting docs,
which will be located under /target
with your browser.
Benchmarks taken on Apple M1
, for a circuit-size of 2^16
constraints:
7.871s
7.643ms
(This time will not vary depending on the circuit-size.)For more results, please run cargo bench
to get a full report of benchmarks in respect of constraint numbers.
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.