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.

92 lines
2.0 KiB

  1. /*
  2. Copyright 2018 0KIMS association.
  3. This file is part of circom (Zero Knowledge Circuit Compiler).
  4. circom is a free software: you can redistribute it and/or modify it
  5. under the terms of the GNU General Public License as published by
  6. the Free Software Foundation, either version 3 of the License, or
  7. (at your option) any later version.
  8. circom is distributed in the hope that it will be useful, but WITHOUT
  9. ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
  10. or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
  11. License for more details.
  12. You should have received a copy of the GNU General Public License
  13. along with circom. If not, see <https://www.gnu.org/licenses/>.
  14. */
  15. template XOR() {
  16. signal input a;
  17. signal input b;
  18. signal output out;
  19. out <== a + b - 2*a*b;
  20. }
  21. template AND() {
  22. signal input a;
  23. signal input b;
  24. signal output out;
  25. out <== a*b;
  26. }
  27. template OR() {
  28. signal input a;
  29. signal input b;
  30. signal output out;
  31. out <== a + b - a*b;
  32. }
  33. template NOT() {
  34. signal input in;
  35. signal output out;
  36. out <== 1 + in - 2*in;
  37. }
  38. template NAND() {
  39. signal input a;
  40. signal input b;
  41. signal output out;
  42. out <== 1 - a*b;
  43. }
  44. template NOR() {
  45. signal input a;
  46. signal input b;
  47. signal output out;
  48. out <== a*b + 1 - a - b;
  49. }
  50. template MultiAND(n) {
  51. signal input in[n];
  52. signal output out;
  53. if (n==1) {
  54. out <== in[0];
  55. } else if (n==2) {
  56. component and1 = AND();
  57. and1.a <== in[0];
  58. and1.b <== in[1];
  59. out <== and1.out;
  60. } else {
  61. component and2 = AND();
  62. component ands[2];
  63. var n1 = n\2;
  64. var n2 = n-n\2;
  65. ands[0] = MultiAND(n1);
  66. ands[1] = MultiAND(n2);
  67. for (var i=0; i<n1; i++) ands[0].in[i] <== in[i];
  68. for (var i=0; i<n2; i++) ands[1].in[i] <== in[n1+i];
  69. and2.a <== ands[0].out;
  70. and2.b <== ands[1].out;
  71. out <== and2.out;
  72. }
  73. }