Clearmatics Libsnark
0.1
C++ library for zkSNARK proofs
|
Go to the documentation of this file.
10 #ifndef LIBSNARK_GADGETLIB2_INCLUDE_GADGETLIB2_ADAPTERS_HPP_
11 #define LIBSNARK_GADGETLIB2_INCLUDE_GADGETLIB2_ADAPTERS_HPP_
46 tuple<linear_combination_t, linear_combination_t, linear_combination_t>
75 #endif // LIBSNARK_GADGETLIB2_INCLUDE_GADGETLIB2_ADAPTERS_HPP_
static size_t getNextFreeIndex()
static void resetVariableIndex()
::std::tuple< linear_combination_t, linear_combination_t, linear_combination_t > constraint_t
linear_term_t convert(const LinearTerm <) const
::std::vector< constraint_t > constraint_sys_t
::std::vector< linear_term_t > sparse_vec_t
::std::map< Variable, FElem, Variable::VariableStrictOrder > VariableAssignment
unsigned long variable_index_t
::std::map< variable_index_t, Fp_elem_t > assignment_t
static size_t getVariableIndex(const Variable &v)
A formal variable, field agnostic.
bool operator==(const GLA::linear_combination_t &lhs, const GLA::linear_term_t &rhs)
::std::pair< variable_index_t, Fp_elem_t > linear_term_t
::std::pair< sparse_vec_t, Fp_elem_t > linear_combination_t
::std::pair< constraint_sys_t, assignment_t > protoboard_t
libff::Fr< libff::default_ec_pp > Fp