arnaucube/ark-r1cs-std
1
0
Fork 0
mirror of https://github.com/arnaucube/ark-r1cs-std.git synced 2026-01-10 16:01:28 +01:00
Code Issues Projects Releases Wiki Activity

Clean up features, and make nightly detection robust

Browse Source
This commit is contained in:
Pratyush Mishra
2020-05-04 05:15:26 -07:00
parent 95fbfe06f6
commit 11e689ddc0
1 changed files with 2 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
README.md
View File

@@ -31,7 +31,8 @@ Informally, the library provides the ability to create transactions that run arb
This repository contains several Rust crates that implement the different building blocks of ZEXE. The high-level structure of the repository is as follows. This repository contains several Rust crates that implement the different building blocks of ZEXE. The high-level structure of the repository is as follows.
* [`algebra`](algebra): Rust crate that provides finite fields and elliptic curves * [`algebra-core`](algebra-core): Rust crate that provides generic arithmetic for finite fields and elliptic curves
* [`algebra`](algebra): Rust crate that provides concrete instantiations of some finite fields and elliptic curves
* [`crypto-primitives`](crypto-primitives): Rust crate that implements some useful cryptographic primitives (and constraints for them) * [`crypto-primitives`](crypto-primitives): Rust crate that implements some useful cryptographic primitives (and constraints for them)
* [`dpc`](dpc): Rust crate that implements DPC schemes (the main cryptographic primitive in this repository) * [`dpc`](dpc): Rust crate that implements DPC schemes (the main cryptographic primitive in this repository)
* [`ff-fft`](ff-fft): Rust crate that provides efficient finite field polynomial arithmetic based on finite field FFTs * [`ff-fft`](ff-fft): Rust crate that provides efficient finite field polynomial arithmetic based on finite field FFTs