Added r1cs ppzksnark proving scheme and some tests.

tinysnark/tinysnark.cpp

@@ -13,6 +13,126 @@ using namespace std;
 
 typedef Fr<default_r1cs_ppzksnark_pp> FieldT;
 
+struct tinysnark_linear_term {
+    FieldT coeff;
+    size_t index;
+};
+
+extern "C" void * tinysnark_gen_proof(void * kp, void * ics, FieldT* primary, FieldT* aux) {
+    r1cs_constraint_system<FieldT>* cs = static_cast<r1cs_constraint_system<FieldT>*>(ics);
+    r1cs_ppzksnark_keypair<default_r1cs_ppzksnark_pp>* keypair = static_cast<r1cs_ppzksnark_keypair<default_r1cs_ppzksnark_pp>*>(kp);
+
+    r1cs_primary_input<FieldT> primary_input(primary, primary+(cs->primary_input_size));
+    r1cs_auxiliary_input<FieldT> aux_input(aux, aux+(cs->auxiliary_input_size));
+
+    auto proof = new r1cs_ppzksnark_proof<default_r1cs_ppzksnark_pp>(
+        r1cs_ppzksnark_prover<default_r1cs_ppzksnark_pp>(keypair->pk, primary_input, aux_input)
+    );
+
+    return static_cast<void*>(std::move(proof));
+}
+
+extern "C" bool tinysnark_verify_proof(void * iproof, void * kp, void * ics, FieldT* primary) {
+    r1cs_ppzksnark_proof<default_r1cs_ppzksnark_pp>* proof = static_cast<r1cs_ppzksnark_proof<default_r1cs_ppzksnark_pp>*>(iproof);
+    r1cs_constraint_system<FieldT>* cs = static_cast<r1cs_constraint_system<FieldT>*>(ics);
+    r1cs_ppzksnark_keypair<default_r1cs_ppzksnark_pp>* keypair = static_cast<r1cs_ppzksnark_keypair<default_r1cs_ppzksnark_pp>*>(kp);
+
+    r1cs_primary_input<FieldT> primary_input(primary, primary+(cs->primary_input_size));
+
+    return r1cs_ppzksnark_verifier_strong_IC<default_r1cs_ppzksnark_pp>(keypair->vk, primary_input, *proof);
+}
+
+extern "C" void * tinysnark_drop_proof(void * proof) {
+    r1cs_ppzksnark_proof<default_r1cs_ppzksnark_pp>* p = static_cast<r1cs_ppzksnark_proof<default_r1cs_ppzksnark_pp>*>(proof);
+
+    delete p;
+}
+
+extern "C" void * tinysnark_gen_keypair(void * ics) {
+    r1cs_constraint_system<FieldT>* cs = static_cast<r1cs_constraint_system<FieldT>*>(ics);
+
+    auto keypair = new r1cs_ppzksnark_keypair<default_r1cs_ppzksnark_pp>(
+        r1cs_ppzksnark_generator<default_r1cs_ppzksnark_pp>(*cs)
+    );
+
+    return static_cast<void*>(std::move(keypair));
+}
+
+extern "C" void * tinysnark_drop_keypair(void * kp) {
+    r1cs_ppzksnark_keypair<default_r1cs_ppzksnark_pp>* k = static_cast<r1cs_ppzksnark_keypair<default_r1cs_ppzksnark_pp>*>(kp);
+
+    delete k;
+}
+
+extern "C" void * tinysnark_new_r1cs(size_t primary_size, size_t aux_size) {
+    auto cs = new r1cs_constraint_system<FieldT>();
+
+    cs->primary_input_size = primary_size;
+    cs->auxiliary_input_size = aux_size;
+
+    return static_cast<void*>(std::move(cs));
+}
+
+extern "C" void tinysnark_drop_r1cs(void * ics) {
+    r1cs_constraint_system<FieldT>* cs = static_cast<r1cs_constraint_system<FieldT>*>(ics);
+
+    delete cs;
+}
+
+extern "C" bool tinysnark_satisfy_test(void * ics, FieldT* primary, FieldT* aux) {
+    r1cs_constraint_system<FieldT>* cs = static_cast<r1cs_constraint_system<FieldT>*>(ics);
+
+    r1cs_primary_input<FieldT> primary_input(primary, primary+(cs->primary_input_size));
+    r1cs_auxiliary_input<FieldT> aux_input(aux, aux+(cs->auxiliary_input_size));
+
+    return cs->is_valid() && cs->is_satisfied(primary_input, aux_input);
+}
+
+extern "C" void * tinysnark_add_constraint(
+    void * ics,
+    tinysnark_linear_term * a_terms,
+    size_t a_terms_len,
+    tinysnark_linear_term * b_terms,
+    size_t b_terms_len,
+    tinysnark_linear_term * c_terms,
+    size_t c_terms_len
+) {
+    r1cs_constraint_system<FieldT>* cs = static_cast<r1cs_constraint_system<FieldT>*>(ics);
+
+    std::vector<linear_term<FieldT>> a;
+    std::vector<linear_term<FieldT>> b;
+    std::vector<linear_term<FieldT>> c;
+
+    for (size_t i = 0; i < a_terms_len; i++) {
+        FieldT coeff = a_terms[i].coeff;
+        size_t index = a_terms[i].index;
+
+        a.push_back(linear_term<FieldT>(variable<FieldT>(index), coeff));
+    }
+
+    for (size_t i = 0; i < b_terms_len; i++) {
+        FieldT coeff = b_terms[i].coeff;
+        size_t index = b_terms[i].index;
+
+        b.push_back(linear_term<FieldT>(variable<FieldT>(index), coeff));
+    }
+
+    for (size_t i = 0; i < c_terms_len; i++) {
+        FieldT coeff = c_terms[i].coeff;
+        size_t index = c_terms[i].index;
+
+        c.push_back(linear_term<FieldT>(variable<FieldT>(index), coeff));
+    }
+
+    linear_combination<FieldT> a_lc(a);
+    linear_combination<FieldT> b_lc(b);
+    linear_combination<FieldT> c_lc(c);
+
+    r1cs_constraint<FieldT> constraint(a_lc, b_lc, c_lc);
+
+    cs->add_constraint(constraint);
+}
+
 extern "C" FieldT tinysnark_fieldt_mul(FieldT a, FieldT b) {
     return a * b;
 }
@@ -52,27 +172,3 @@ extern "C" void tinysnark_init_public_params() {
         assert(sizeof(p) == 32);
     }
 }
-
-extern "C" void tinysnark_test() {
-    protoboard<FieldT> pb;
-
-    linear_combination<FieldT> sum;
-
-    sum = sum + 1;
-
-    pb.add_r1cs_constraint(r1cs_constraint<FieldT>(1, sum, 1), "testing");
-
-    assert(pb.is_satisfied());
-
-    const r1cs_constraint_system<FieldT> constraint_system = pb.get_constraint_system();
-
-    cout << "Number of R1CS constraints: " << constraint_system.num_constraints() << endl;
-
-	auto keypair = r1cs_ppzksnark_generator<default_r1cs_ppzksnark_pp>(constraint_system);
-
-	auto proof = r1cs_ppzksnark_prover<default_r1cs_ppzksnark_pp>(keypair.pk, pb.primary_input(), pb.auxiliary_input());
-
-	r1cs_primary_input<FieldT> input;
-
-	assert(r1cs_ppzksnark_verifier_strong_IC<default_r1cs_ppzksnark_pp>(keypair.vk, input, proof));
-}