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.
45 lines
1.2 KiB
45 lines
1.2 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/>.
|
|
*/
|
|
|
|
/* Maj function for sha256
|
|
|
|
out = a&b ^ a&c ^ b&c =>
|
|
|
|
out = a*b + a*c + b*c - 2*a*b*c =>
|
|
|
|
out = a*( b + c - 2*b*c ) + b*c =>
|
|
|
|
mid = b*c
|
|
out = a*( b + c - 2*mid ) + mid
|
|
|
|
*/
|
|
pragma circom 2.0.0;
|
|
|
|
template Maj_t(n) {
|
|
signal input a[n];
|
|
signal input b[n];
|
|
signal input c[n];
|
|
signal output out[n];
|
|
signal mid[n];
|
|
|
|
for (var k=0; k<n; k++) {
|
|
mid[k] <== b[k]*c[k];
|
|
out[k] <== a[k] * (b[k]+c[k]-2*mid[k]) + mid[k];
|
|
}
|
|
}
|