r1cs_gg_ppzksnark.hpp

Go to the documentation of this file.

 
#ifndef R1CS_GG_PPZKSNARK_HPP_
#define R1CS_GG_PPZKSNARK_HPP_
 
#include <libff/algebra/curves/public_params.hpp>
#include <libsnark/common/data_structures/accumulation_vector.hpp>
#include <libsnark/knowledge_commitment/knowledge_commitment.hpp>
#include <libsnark/relations/constraint_satisfaction_problems/r1cs/r1cs.hpp>
#include <libsnark/zk_proof_systems/ppzksnark/r1cs_gg_ppzksnark/r1cs_gg_ppzksnark_params.hpp>
#include <memory>
 
namespace libsnark
{
 
/******************************** Proving key ********************************/
 
template<typename ppT> class r1cs_gg_ppzksnark_proving_key;
 
template<typename ppT>
std::ostream &operator<<(
    std::ostream &out, const r1cs_gg_ppzksnark_proving_key<ppT> &pk);
 
template<typename ppT>
std::istream &operator>>(
    std::istream &in, r1cs_gg_ppzksnark_proving_key<ppT> &pk);
 
template<typename ppT> class r1cs_gg_ppzksnark_proving_key
{
public:
    libff::G1<ppT> alpha_g1;
    libff::G1<ppT> beta_g1;
    libff::G2<ppT> beta_g2;
    libff::G1<ppT> delta_g1;
    libff::G2<ppT> delta_g2;
 
    libff::G1_vector<ppT>
        A_query; // this could be a sparse vector if we had multiexp for those
    knowledge_commitment_vector<libff::G2<ppT>, libff::G1<ppT>> B_query;
    libff::G1_vector<ppT> H_query;
    libff::G1_vector<ppT> L_query;
 
    r1cs_gg_ppzksnark_constraint_system<ppT> constraint_system;
 
    r1cs_gg_ppzksnark_proving_key(){};
    r1cs_gg_ppzksnark_proving_key<ppT> &operator=(
        const r1cs_gg_ppzksnark_proving_key<ppT> &other) = default;
    r1cs_gg_ppzksnark_proving_key(
        const r1cs_gg_ppzksnark_proving_key<ppT> &other) = default;
    r1cs_gg_ppzksnark_proving_key(r1cs_gg_ppzksnark_proving_key<ppT> &&other) =
        default;
    r1cs_gg_ppzksnark_proving_key(
        libff::G1<ppT> &&alpha_g1,
        libff::G1<ppT> &&beta_g1,
        libff::G2<ppT> &&beta_g2,
        libff::G1<ppT> &&delta_g1,
        libff::G2<ppT> &&delta_g2,
        libff::G1_vector<ppT> &&A_query,
        knowledge_commitment_vector<libff::G2<ppT>, libff::G1<ppT>> &&B_query,
        libff::G1_vector<ppT> &&H_query,
        libff::G1_vector<ppT> &&L_query,
        r1cs_gg_ppzksnark_constraint_system<ppT> &&constraint_system)
        : alpha_g1(std::move(alpha_g1))
        , beta_g1(std::move(beta_g1))
        , beta_g2(std::move(beta_g2))
        , delta_g1(std::move(delta_g1))
        , delta_g2(std::move(delta_g2))
        , A_query(std::move(A_query))
        , B_query(std::move(B_query))
        , H_query(std::move(H_query))
        , L_query(std::move(L_query))
        , constraint_system(std::move(constraint_system)){};
 
    size_t G1_size() const
    {
        // 1 (alpha_g1) + 1 (beta_g1) + 1 (delta_g1) + A_query + B_query +
        // H_query + L_query
        return 1 + 1 + 1 + A_query.size() + B_query.domain_size() +
               H_query.size() + L_query.size();
    }
 
    size_t G2_size() const
    {
        // 1 (beta_g2) + 1 (delta_g2) + B_query
        return 1 + 1 + B_query.domain_size();
    }
 
    size_t G1_sparse_size() const
    {
        return 1 + A_query.size() + B_query.size() + H_query.size() +
               L_query.size();
    }
 
    size_t G2_sparse_size() const { return 1 + B_query.size(); }
 
    size_t size_in_bits() const
    {
        return (
            libff::size_in_bits(A_query) + B_query.size_in_bits() +
            libff::size_in_bits(H_query) + libff::size_in_bits(L_query) +
            1 * libff::G1<ppT>::size_in_bits() +
            1 * libff::G2<ppT>::size_in_bits());
    }
 
    void print_size() const
    {
        libff::print_indent();
        printf("* G1 elements in PK: %zu\n", this->G1_size());
        libff::print_indent();
        printf("* Non-zero G1 elements in PK: %zu\n", this->G1_sparse_size());
        libff::print_indent();
        printf("* G2 elements in PK: %zu\n", this->G2_size());
        libff::print_indent();
        printf("* Non-zero G2 elements in PK: %zu\n", this->G2_sparse_size());
        libff::print_indent();
        printf("* PK size in bits: %zu\n", this->size_in_bits());
    }
 
    bool operator==(const r1cs_gg_ppzksnark_proving_key<ppT> &other) const;
    friend std::ostream &operator<<<ppT>(
        std::ostream &out, const r1cs_gg_ppzksnark_proving_key<ppT> &pk);
    friend std::istream &operator>>
        <ppT>(std::istream &in, r1cs_gg_ppzksnark_proving_key<ppT> &pk);
};
 
/******************************* Verification key ****************************/
 
template<typename ppT> class r1cs_gg_ppzksnark_verification_key;
 
template<typename ppT>
std::ostream &operator<<(
    std::ostream &out, const r1cs_gg_ppzksnark_verification_key<ppT> &vk);
 
template<typename ppT>
std::istream &operator>>(
    std::istream &in, r1cs_gg_ppzksnark_verification_key<ppT> &vk);
 
template<typename ppT> class r1cs_gg_ppzksnark_verification_key
{
public:
    libff::G1<ppT> alpha_g1;
    libff::G2<ppT> beta_g2;
    libff::G2<ppT> delta_g2;
 
    accumulation_vector<libff::G1<ppT>> ABC_g1;
 
    r1cs_gg_ppzksnark_verification_key() = default;
    r1cs_gg_ppzksnark_verification_key(
        const libff::G1<ppT> &alpha_g1,
        const libff::G2<ppT> &beta_g2,
        const libff::G2<ppT> &delta_g2,
        const accumulation_vector<libff::G1<ppT>> &ABC_g1)
        : alpha_g1(alpha_g1)
        , beta_g2(beta_g2)
        , delta_g2(delta_g2)
        , ABC_g1(ABC_g1){};
 
    size_t G1_size() const { return ABC_g1.size() + 1; }
 
    size_t G2_size() const { return 2; }
 
    size_t size_in_bits() const
    {
 
        return (
            ABC_g1.size_in_bits() + 2 * libff::G2<ppT>::size_in_bits() +
            libff::G1<ppT>::size_in_bits());
    }
 
    void print_size() const
    {
        libff::print_indent();
        printf("* G1 elements in VK: %zu\n", this->G1_size());
        libff::print_indent();
        printf("* G2 elements in VK: %zu\n", this->G2_size());
        libff::print_indent();
        printf("* VK size in bits: %zu\n", this->size_in_bits());
    }
 
    bool operator==(const r1cs_gg_ppzksnark_verification_key<ppT> &other) const;
    friend std::ostream &operator<<<ppT>(
        std::ostream &out, const r1cs_gg_ppzksnark_verification_key<ppT> &vk);
    friend std::istream &operator>>
        <ppT>(std::istream &in, r1cs_gg_ppzksnark_verification_key<ppT> &vk);
 
    static r1cs_gg_ppzksnark_verification_key<ppT> dummy_verification_key(
        const size_t input_size);
};
 
/************************ Processed verification key *************************/
 
template<typename ppT> class r1cs_gg_ppzksnark_processed_verification_key;
 
template<typename ppT>
std::ostream &operator<<(
    std::ostream &out,
    const r1cs_gg_ppzksnark_processed_verification_key<ppT> &pvk);
 
template<typename ppT>
std::istream &operator>>(
    std::istream &in, r1cs_gg_ppzksnark_processed_verification_key<ppT> &pvk);
 
template<typename ppT> class r1cs_gg_ppzksnark_processed_verification_key
{
public:
    libff::G1_precomp<ppT> vk_alpha_g1_precomp;
    libff::G2_precomp<ppT> vk_beta_g2_precomp;
    libff::G2_precomp<ppT> vk_generator_g2_precomp;
    libff::G2_precomp<ppT> vk_delta_g2_precomp;
 
    accumulation_vector<libff::G1<ppT>> ABC_g1;
 
    bool operator==(
        const r1cs_gg_ppzksnark_processed_verification_key &other) const;
    friend std::ostream &operator<<<ppT>(
        std::ostream &out,
        const r1cs_gg_ppzksnark_processed_verification_key<ppT> &pvk);
    friend std::istream &operator>><ppT>(
        std::istream &in,
        r1cs_gg_ppzksnark_processed_verification_key<ppT> &pvk);
};
 
/********************************** Key pair *********************************/
 
template<typename ppT> class r1cs_gg_ppzksnark_keypair
{
public:
    r1cs_gg_ppzksnark_proving_key<ppT> pk;
    r1cs_gg_ppzksnark_verification_key<ppT> vk;
 
    r1cs_gg_ppzksnark_keypair() = default;
    r1cs_gg_ppzksnark_keypair(const r1cs_gg_ppzksnark_keypair<ppT> &other) =
        default;
    r1cs_gg_ppzksnark_keypair(
        r1cs_gg_ppzksnark_proving_key<ppT> &&pk,
        r1cs_gg_ppzksnark_verification_key<ppT> &&vk)
        : pk(std::move(pk)), vk(std::move(vk))
    {
    }
 
    r1cs_gg_ppzksnark_keypair(r1cs_gg_ppzksnark_keypair<ppT> &&other) = default;
};
 
/*********************************** Proof ***********************************/
 
template<typename ppT> class r1cs_gg_ppzksnark_proof;
 
template<typename ppT>
std::ostream &operator<<(
    std::ostream &out, const r1cs_gg_ppzksnark_proof<ppT> &proof);
 
template<typename ppT>
std::istream &operator>>(std::istream &in, r1cs_gg_ppzksnark_proof<ppT> &proof);
 
template<typename ppT> class r1cs_gg_ppzksnark_proof
{
public:
    libff::G1<ppT> g_A;
    libff::G2<ppT> g_B;
    libff::G1<ppT> g_C;
 
    r1cs_gg_ppzksnark_proof()
    {
        // invalid proof with valid curve points
        this->g_A = libff::G1<ppT>::one();
        this->g_B = libff::G2<ppT>::one();
        this->g_C = libff::G1<ppT>::one();
    }
    r1cs_gg_ppzksnark_proof(
        libff::G1<ppT> &&g_A, libff::G2<ppT> &&g_B, libff::G1<ppT> &&g_C)
        : g_A(std::move(g_A)), g_B(std::move(g_B)), g_C(std::move(g_C)){};
 
    size_t G1_size() const { return 2; }
 
    size_t G2_size() const { return 1; }
 
    size_t size_in_bits() const
    {
        return G1_size() * libff::G1<ppT>::size_in_bits() +
               G2_size() * libff::G2<ppT>::size_in_bits();
    }
 
    void print_size() const
    {
        libff::print_indent();
        printf("* G1 elements in proof: %zu\n", this->G1_size());
        libff::print_indent();
        printf("* G2 elements in proof: %zu\n", this->G2_size());
        libff::print_indent();
        printf("* Proof size in bits: %zu\n", this->size_in_bits());
    }
 
    bool is_well_formed() const
    {
        return (
            g_A.is_well_formed() && g_B.is_well_formed() &&
            g_C.is_well_formed());
    }
 
    bool operator==(const r1cs_gg_ppzksnark_proof<ppT> &other) const;
    friend std::ostream &operator<<<ppT>(
        std::ostream &out, const r1cs_gg_ppzksnark_proof<ppT> &proof);
    friend std::istream &operator>>
        <ppT>(std::istream &in, r1cs_gg_ppzksnark_proof<ppT> &proof);
};
 
/***************************** Main algorithms *******************************/
 
template<
    typename ppT,
    libff::multi_exp_base_form BaseForm = libff::multi_exp_base_form_special>
r1cs_gg_ppzksnark_keypair<ppT> r1cs_gg_ppzksnark_generator_from_secrets(
    const r1cs_gg_ppzksnark_constraint_system<ppT> &cs,
    const libff::Fr<ppT> &t,
    const libff::Fr<ppT> &alpha,
    const libff::Fr<ppT> &beta,
    const libff::Fr<ppT> &delta,
    const libff::G1<ppT> &g1_generator,
    const libff::G2<ppT> &g2_generator,
    bool force_pow_2_domain = false);
 
template<
    typename ppT,
    libff::multi_exp_base_form BaseForm = libff::multi_exp_base_form_special>
r1cs_gg_ppzksnark_keypair<ppT> r1cs_gg_ppzksnark_generator(
    const r1cs_gg_ppzksnark_constraint_system<ppT> &cs,
    bool force_pow_2_domain = false);
 
template<
    typename ppT,
    libff::multi_exp_method Method = libff::multi_exp_method_BDLO12_signed,
    libff::multi_exp_base_form BaseForm = libff::multi_exp_base_form_special>
r1cs_gg_ppzksnark_proof<ppT> r1cs_gg_ppzksnark_prover(
    const r1cs_gg_ppzksnark_proving_key<ppT> &pk,
    const r1cs_gg_ppzksnark_primary_input<ppT> &primary_input,
    const r1cs_gg_ppzksnark_auxiliary_input<ppT> &auxiliary_input,
    bool force_pow_2_domain = false);
 
/*
  Below are four variants of verifier algorithm for the R1CS GG-ppzkSNARK.
 
  These are the four cases that arise from the following two choices:
 
  (1) The verifier accepts a (non-processed) verification key or, instead, a
  processed verification key. In the latter case, we call the algorithm an
  "online verifier".
 
  (2) The verifier checks for "weak" input consistency or, instead, "strong"
  input consistency. Strong input consistency requires that |primary_input| =
  CS.num_inputs, whereas weak input consistency requires that |primary_input| <=
  CS.num_inputs (and the primary input is implicitly padded with zeros up to
  length CS.num_inputs).
*/
 
template<typename ppT>
bool r1cs_gg_ppzksnark_verifier_weak_IC(
    const r1cs_gg_ppzksnark_verification_key<ppT> &vk,
    const r1cs_gg_ppzksnark_primary_input<ppT> &primary_input,
    const r1cs_gg_ppzksnark_proof<ppT> &proof);
 
template<typename ppT>
bool r1cs_gg_ppzksnark_verifier_strong_IC(
    const r1cs_gg_ppzksnark_verification_key<ppT> &vk,
    const r1cs_gg_ppzksnark_primary_input<ppT> &primary_input,
    const r1cs_gg_ppzksnark_proof<ppT> &proof);
 
template<typename ppT>
r1cs_gg_ppzksnark_processed_verification_key<ppT>
r1cs_gg_ppzksnark_verifier_process_vk(
    const r1cs_gg_ppzksnark_verification_key<ppT> &vk);
 
template<typename ppT>
bool r1cs_gg_ppzksnark_online_verifier_weak_IC(
    const r1cs_gg_ppzksnark_processed_verification_key<ppT> &pvk,
    const r1cs_gg_ppzksnark_primary_input<ppT> &input,
    const r1cs_gg_ppzksnark_proof<ppT> &proof);
 
template<typename ppT>
bool r1cs_gg_ppzksnark_online_verifier_strong_IC(
    const r1cs_gg_ppzksnark_processed_verification_key<ppT> &pvk,
    const r1cs_gg_ppzksnark_primary_input<ppT> &primary_input,
    const r1cs_gg_ppzksnark_proof<ppT> &proof);
 
/****************************** Miscellaneous ********************************/
 
template<typename ppT>
bool r1cs_gg_ppzksnark_affine_verifier_weak_IC(
    const r1cs_gg_ppzksnark_verification_key<ppT> &vk,
    const r1cs_gg_ppzksnark_primary_input<ppT> &primary_input,
    const r1cs_gg_ppzksnark_proof<ppT> &proof);
 
} // namespace libsnark
 
#include <libsnark/zk_proof_systems/ppzksnark/r1cs_gg_ppzksnark/r1cs_gg_ppzksnark.tcc>
 
#endif // R1CS_GG_PPZKSNARK_HPP_