OpenZKP

OpenZKP - pure Rust implementations of Zero-Knowledge Proof systems.

Overview

The current version has

• 🌞 a simple interface (see the example below),
• 🗜️ succinct proofs,
• 🏎️ decent performance, and
• 🌐 webassembly support.

That being said, it also has a number of limitations, it has

• no high-level language,
• no comprehensive security audit,
• no perfect zero-knowledge,
• hard-coded field and hash function,

and some others, see features and limitations below for details.

Packages

Package	Version	Description
utils/
criterion-utils		Criterion helpers to benchmark over size and number of processors.
error-utils		Assertion like macros for returning Result::Err.
logging-allocator		Wrapper around the system allocator that logs large allocations.
mmap-vec		Replacement for Vec that uses file-backed storage.
macros-lib		Library of procedural macros implemented using proc_macro2
macros-impl		Implementation crate for proc_macro_hack
macros-decl		Procedural macros.
algebra/
u256		Implementation of 256-bit unsigned integers.
primefield		A 251-bit prime field suitable for FFTs.
elliptic-curve		A crypto-grade elliptic curve over the primefield.
crypto/
elliptic-curve-crypto		Pedersen commitments and digital signatures.
hash		Hash primitive used in zkp-stark.
merkle-tree		Merkle tree based vector commitment.
zkp-stark		Implementation of the STARK ZK-proof system.

Example

Think of a secret number $n$ and start a sequence with $x_0 = 1$ and $x_1 = n$. Then proceed as a Fibonacci sequence: $x_i = x_{i-2} + x_{i-1}$. We want to proof someone we know $x_k$ without revealing $n$.

use zkp-stark::{Provable, Verifiable, TraceTable, FieldElement, Constraints};

struct Claim {
    index: usize,
    value: FieldElement,
}

impl Verifiable for Claim {
    fn constraints(&self) -> Constraints {
        use RationalExpression::*;

        // Seed
        let mut seed = self.index.to_be_bytes().to_vec();
        seed.extend_from_slice(&self.value.as_montgomery().to_bytes_be());

        // Constraint repetitions
        let trace_length = self.index.next_power_of_two();
        let g = Constant(FieldElement::root(trace_length).unwrap());
        let on_row = |index| (X - g.pow(index)).inv();
        let every_row = || (X - g.pow(trace_length - 1)) / (X.pow(trace_length) - 1.into());

        Constraints::from_expressions((trace_length, 2), seed, vec![
            (Trace(0, 1) - Trace(1, 0)) * every_row(),
            (Trace(1, 1) - Trace(0, 0) - Trace(1, 0)) * every_row(),
            (Trace(0, 0) - 1.into()) * on_row(0),
            (Trace(0, 0) - (&self.value).into()) * on_row(self.index),
        ])
        .unwrap()
    }
}

impl Provable<FieldElement> for Claim {
    fn trace(&self, witness: &Witness) -> TraceTable {
        let trace_length = self.index.next_power_of_two();
        let mut trace = TraceTable::new(trace_length, 2);
        trace[(0, 0)] = 1.into();
        trace[(0, 1)] = witness;
        for i in 0..(trace_length - 1) {
            trace[(i + 1, 0)] = trace[(i, 1)].clone();
            trace[(i + 1, 1)] = &trace[(i, 0)] + &trace[(i, 1)];
        }
        trace
    }
}

pub fn main() {
    let claim = Claim {
        index: 5000,
        value: field_element!("1337"),
    };
    let secret = field_element!("42");
    let proof = claim.proof(&secret).unwrap();
    claim.verify(proof).unwrap();
}

Features and Limitations

Features

A simple interface. The public interface is simple and is considered semver-stable. Future versions are expected to add functionality without breaking this interface.

Succinct proofs. For a given security parameter, the proof size is close to minimal. Significant improvements here would require innovations in the way constraint systems are designed or in the underlying cryptography.

Decent performance. All steps of the proof are using asymptotically optimal algorithms and all of the major steps are multi-threaded. There are no hard memory requirements. We can expect a good amount of performance improvements by fine-tuning, but we don't expect orders of magnitude improvements.

Webassembly support. The verifier can be used in a WebAssembly environment without the Rust std lib. The prover will work too, but has not been a priority.

Limitations

No high-level language. Constraints are specified using their algebraic expressions. This requires complicated and careful design from the library user and is easy to do wrong, leading to insecure systems. A high level language would help make development simpler and safer and facilitate re-use of components.

No comprehensive security audit. While development is done with the best security practices in mind, it is still very early stage and has not had the amount of expert peer review required for a production grade system.

No perfect zero-knowledge. The current implementation provides succinct proofs but not perfect zero knowledge. While non-trivial, it is theoretically possible to learn something about the secret. Achieving perfect zero-knowledge is possible and can be implemented.

No side-channel resistance. The implementation favours performance over side-channel resistance. While this is common in zero-knowledge proof system, you should be aware that his might leak intermediate computations. Side-channel resistance can be implemented.

Hard-coded field and hash. The current implementation uses a particular prime field and a particular hash function. These are optimized for verification in the Ethereum Virtual Machine. This can be generalized to other primitives optimized for other use cases.

Contributing

See our Contributing guideline and Code of conduct.

See CircleCI documentation on how to run tests locally.