sigma-compiler 0.2.3

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

#![allow(non_snake_case)]
use curve25519_dalek::ristretto::RistrettoPoint as G;
use sigma_compiler::*;

#[test]
fn emptystatement_test() -> sigma_proofs::errors::Result<()> {
    sigma_compiler! { proof,
        (),
        (),
    }

    let mut rng = rand::thread_rng();

    let instance = proof::Instance {};
    let witness = proof::Witness {};

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