Boolean-and
Formalization and verification of a circuit
for boolean conjunction.
Given two field elements x and y representing booleans
(i.e. such that each field element is either 0 or 1;
see boolean-assert),
their conjunction z is obtained via a constraint of the form
which defines z to be 1 if both x and y are 1, otherwise 0.
Thus, z is boolean (0 or 1) if both x and y are.
Subtopics
- Boolean-and-spec
- Specification of the circuit.
- Boolean-and-circuit
- Construction of the circuit.
- Boolean-and-correctness
- Correctness of the circuit.
- Boolean-and-lifting
- Lifting of the circuit to a predicate.
