-
Notifications
You must be signed in to change notification settings - Fork 10
Expand file tree
/
Copy pathcomparators.circom
More file actions
117 lines (89 loc) · 2.43 KB
/
comparators.circom
File metadata and controls
117 lines (89 loc) · 2.43 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
/*
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/>.
*/
pragma circom 2.0.0;
template Num2Bits(n) {
signal input in;
signal output out[n];
var lc1=0;
var e2=1;
for (var i = 0; i<n; i++) {
out[i] <-- (in >> i) & 1;
out[i] * (out[i] -1 ) === 0;
lc1 += out[i] * e2;
e2 = e2+e2;
}
lc1 === in;
}
// `out` signal will be set to 1 if `a < b` else 0.
template LessThan(n) {
assert(n <= 252);
signal input a;
signal input b;
signal output out;
component n2b = Num2Bits(n+1);
n2b.in <== a + (1<<n) - b;
out <== 1-n2b.out[n];
}
// N is the number of bits the input have.
// The MSF is the sign bit.
template LessEqThan(n) {
signal input a;
signal input b;
signal output out;
component lt = LessThan(n);
lt.a <== a;
lt.b <== b+1;
lt.out ==> out;
}
// N is the number of bits the input have.
// The MSF is the sign bit.
template GreaterThan(n) {
signal input a;
signal input b;
signal output out;
component lt = LessThan(n);
lt.a <== b;
lt.b <== a;
lt.out ==> out;
}
// N is the number of bits the input have.
// The MSF is the sign bit.
template GreaterEqThan(n) {
signal input a;
signal input b;
signal output out;
component lt = LessThan(n);
lt.a <== b;
lt.b <== a+1;
lt.out ==> out;
}
// `out` signal will be set to 1 if `in == 0` else 0.
template IsZero() {
signal input in;
signal output out;
signal inv;
inv <-- in!=0 ? 1/in : 0;
out <== -in*inv +1;
in*out === 0;
}
// `out` signal will be set to 1 if `a == b` else 0.
template IsEqual() {
signal input a;
signal input b;
signal output out;
component isz = IsZero();
b - a ==> isz.in;
isz.out ==> out;
}