You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
93 lines
2.0 KiB
93 lines
2.0 KiB
/*
|
|
Copyright 2018 0KIMS association.
|
|
|
|
This file is part of circom (Zero Knowledge Circuit Compiler).
|
|
|
|
circom is a free software: you can redistribute it and/or modify it
|
|
under the terms of the GNU General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
circom is distributed in the hope that it will be useful, but WITHOUT
|
|
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
|
|
or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
|
|
License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with circom. If not, see <https://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
template XOR() {
|
|
signal input a;
|
|
signal input b;
|
|
signal output out;
|
|
|
|
out <== a + b - 2*a*b;
|
|
}
|
|
|
|
template AND() {
|
|
signal input a;
|
|
signal input b;
|
|
signal output out;
|
|
|
|
out <== a*b;
|
|
}
|
|
|
|
template OR() {
|
|
signal input a;
|
|
signal input b;
|
|
signal output out;
|
|
|
|
out <== a + b - a*b;
|
|
}
|
|
|
|
template NOT() {
|
|
signal input in;
|
|
signal output out;
|
|
|
|
out <== 1 + in - 2*in;
|
|
}
|
|
|
|
template NAND() {
|
|
signal input a;
|
|
signal input b;
|
|
signal output out;
|
|
|
|
out <== 1 - a*b;
|
|
}
|
|
|
|
template NOR() {
|
|
signal input a;
|
|
signal input b;
|
|
signal output out;
|
|
|
|
out <== a*b + 1 - a - b;
|
|
}
|
|
|
|
template MultiAND(n) {
|
|
signal input in[n];
|
|
signal output out;
|
|
var i;
|
|
if (n==1) {
|
|
out <== in[0];
|
|
} else if (n==2) {
|
|
component and1 = AND();
|
|
and1.a <== in[0];
|
|
and1.b <== in[1];
|
|
out <== and1.out;
|
|
} else {
|
|
component and2 = AND();
|
|
component ands[2];
|
|
var n1 = n\2;
|
|
var n2 = n-n\2;
|
|
ands[0] = MultiAND(n1);
|
|
ands[1] = MultiAND(n2);
|
|
for (i=0; i<n1; i++) ands[0].in[i] <== in[i];
|
|
for (i=0; i<n2; i++) ands[1].in[i] <== in[n1+i];
|
|
and2.a <== ands[0].out;
|
|
and2.b <== ands[1].out;
|
|
out <== and2.out;
|
|
}
|
|
}
|
|
|
|
|