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.

58 lines
1.6 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. pragma circom 2.0.0;
  16. include "../binsum.circom";
  17. include "sigma.circom";
  18. include "ch.circom";
  19. template T1() {
  20. signal input h[32];
  21. signal input e[32];
  22. signal input f[32];
  23. signal input g[32];
  24. signal input k[32];
  25. signal input w[32];
  26. signal output out[32];
  27. var ki;
  28. component ch = Ch_t(32);
  29. component bigsigma1 = BigSigma(6, 11, 25);
  30. for (ki=0; ki<32; ki++) {
  31. bigsigma1.in[ki] <== e[ki];
  32. ch.a[ki] <== e[ki];
  33. ch.b[ki] <== f[ki];
  34. ch.c[ki] <== g[ki];
  35. }
  36. component sum = BinSum(32, 5);
  37. for (ki=0; ki<32; ki++) {
  38. sum.in[0][ki] <== h[ki];
  39. sum.in[1][ki] <== bigsigma1.out[ki];
  40. sum.in[2][ki] <== ch.out[ki];
  41. sum.in[3][ki] <== k[ki];
  42. sum.in[4][ki] <== w[ki];
  43. }
  44. for (ki=0; ki<32; ki++) {
  45. out[ki] <== sum.out[ki];
  46. }
  47. }