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
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50

use libzeropool::{
    circuit::{tree::tree_update, tx::c_transfer},
    fawkes_crypto::{
        backend::bellman_groth16::{
            engines::Engine,
            prover::{prove, Proof},
            Parameters,
        },
        ff_uint::Num,
    },
    native::{
        params::PoolParams,
        tree::{TreePub, TreeSec},
        tx::{TransferPub, TransferSec},
    },
};

pub fn prove_tx<P, E>(
    params: &Parameters<E>,
    pool_params: &P,
    transfer_pub: TransferPub<E::Fr>,
    transfer_sec: TransferSec<E::Fr>,
) -> (Vec<Num<E::Fr>>, Proof<E>)
where
    P: PoolParams<Fr = E::Fr>,
    E: Engine,
{
    let circuit = |public, secret| {
        c_transfer(&public, &secret, pool_params);
    };

    prove(params, &transfer_pub, &transfer_sec, circuit)
}

pub fn prove_tree<P, E>(
    params: &Parameters<E>,
    pool_params: &P,
    tree_pub: TreePub<E::Fr>,
    tree_sec: TreeSec<E::Fr>,
) -> (Vec<Num<E::Fr>>, Proof<E>)
where
    P: PoolParams<Fr = E::Fr>,
    E: Engine,
{
    let circuit = |public, secret| {
        tree_update(&public, &secret, pool_params);
    };

    prove(params, &tree_pub, &tree_sec, circuit)
}