tbcs_to_uscs.hpp File Reference

#include <libsnark/relations/circuit_satisfaction_problems/tbcs/tbcs.hpp>
#include <libsnark/relations/constraint_satisfaction_problems/uscs/uscs.hpp>
#include <libsnark/reductions/tbcs_to_uscs/tbcs_to_uscs.tcc>

Include dependency graph for tbcs_to_uscs.hpp:

Go to the source code of this file.

Namespaces
	libsnark

Functions
template<typename FieldT >
uscs_constraint_system< FieldT >	libsnark::tbcs_to_uscs_instance_map (const tbcs_circuit &circuit)
template<typename FieldT >
uscs_variable_assignment< FieldT >	libsnark::tbcs_to_uscs_witness_map (const tbcs_circuit &circuit, const tbcs_primary_input &primary_input, const tbcs_auxiliary_input &auxiliary_input)

Detailed Description

Declaration of interfaces for a TBCS-to-USCS reduction, that is, constructing a USCS ("Unitary-Square Constraint System") from a TBCS ("Two-input Boolean Circuit Satisfiability").

The reduction is straightforward: each non-output wire is mapped to a corresponding USCS constraint that enforces the wire to carry a boolean value; each 2-input boolean gate is mapped to a corresponding USCS constraint that enforces correct computation of the gate; each output wire is mapped to a corresponding USCS constraint that enforces that the output is zero.

The mapping of a gate to a USCS constraint is due to [GOS12].

References:

[GOS12]: "New techniques for noninteractive zero-knowledge", Jens Groth, Rafail Ostrovsky, Amit Sahai JACM 2012, http://www0.cs.ucl.ac.uk/staff/J.Groth/NIZKJournal.pdf

Author

This file is part of libsnark, developed by SCIPR Lab and contributors (see AUTHORS).

Copyright

MIT license (see LICENSE file)

Definition in file tbcs_to_uscs.hpp.