sigma-compiler 0.2.1

Crate for automatically generating code for sigma zero-knowledge proof protocols of more complex statements than are supported by the sigma-proofs crate. The statements given to this crate are compiled into statements about linear combinations of points, and transformed into the sigma-proofs API.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35

#![allow(non_snake_case)]
use curve25519_dalek::ristretto::RistrettoPoint as G;
use group::ff::PrimeField;
use group::Group;
use sha2::Sha512;
use sigma_compiler::*;

#[test]
fn range_test() -> sigma_proofs::errors::Result<()> {
    sigma_compiler! { proof,
        (x, y, pub a, rand r),
        (C, D, const cind A, const cind B),
        C = (3*x+1)*A + (2*r+3)*B,
        D = x*A + y*B,
        (a..20).contains(x),
        (0..a).contains(y),
    }

    type Scalar = <G as Group>::Scalar;
    let mut rng = rand::thread_rng();
    let A = G::hash_from_bytes::<Sha512>(b"Generator A");
    let B = G::generator();
    let a = Scalar::from_u128(3);
    let r = Scalar::random(&mut rng);
    let x = Scalar::from_u128(19);
    let y = Scalar::from_u128(2);
    let C = (x + x + x + Scalar::ONE) * A + (r + r + Scalar::from_u128(3)) * B;
    let D = x * A + y * B;

    let instance = proof::Instance { C, D, a, A, B };
    let witness = proof::Witness { x, y, r };

    let proof = proof::prove(&instance, &witness, b"range_test", &mut rng)?;
    proof::verify(&instance, &proof, b"range_test")
}