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.

236 lines
7.5 KiB

  1. include "montgomery.circom";
  2. include "mux3.circom";
  3. include "babyjub.circom";
  4. template Window4() {
  5. signal input in[4];
  6. signal input base[2];
  7. signal output out[2];
  8. signal output out8[2]; // Returns 8*Base (To be linked)
  9. component mux = MultiMux3(2);
  10. mux.s[0] <== in[0];
  11. mux.s[1] <== in[1];
  12. mux.s[2] <== in[2];
  13. component dbl2 = MontgomeryDouble();
  14. component adr3 = MontgomeryAdd();
  15. component adr4 = MontgomeryAdd();
  16. component adr5 = MontgomeryAdd();
  17. component adr6 = MontgomeryAdd();
  18. component adr7 = MontgomeryAdd();
  19. component adr8 = MontgomeryAdd();
  20. // in[0] -> 1*BASE
  21. mux.c[0][0] <== base[0];
  22. mux.c[1][0] <== base[1];
  23. // in[1] -> 2*BASE
  24. dbl2.in[0] <== base[0];
  25. dbl2.in[1] <== base[1];
  26. mux.c[0][1] <== dbl2.out[0];
  27. mux.c[1][1] <== dbl2.out[1];
  28. // in[2] -> 3*BASE
  29. adr3.in1[0] <== base[0];
  30. adr3.in1[1] <== base[1];
  31. adr3.in2[0] <== dbl2.out[0];
  32. adr3.in2[1] <== dbl2.out[1];
  33. mux.c[0][2] <== adr3.out[0];
  34. mux.c[1][2] <== adr3.out[1];
  35. // in[3] -> 4*BASE
  36. adr4.in1[0] <== base[0];
  37. adr4.in1[1] <== base[1];
  38. adr4.in2[0] <== adr3.out[0];
  39. adr4.in2[1] <== adr3.out[1];
  40. mux.c[0][3] <== adr4.out[0];
  41. mux.c[1][3] <== adr4.out[1];
  42. // in[4] -> 5*BASE
  43. adr5.in1[0] <== base[0];
  44. adr5.in1[1] <== base[1];
  45. adr5.in2[0] <== adr4.out[0];
  46. adr5.in2[1] <== adr4.out[1];
  47. mux.c[0][4] <== adr5.out[0];
  48. mux.c[1][4] <== adr5.out[1];
  49. // in[5] -> 6*BASE
  50. adr6.in1[0] <== base[0];
  51. adr6.in1[1] <== base[1];
  52. adr6.in2[0] <== adr5.out[0];
  53. adr6.in2[1] <== adr5.out[1];
  54. mux.c[0][5] <== adr6.out[0];
  55. mux.c[1][5] <== adr6.out[1];
  56. // in[6] -> 7*BASE
  57. adr7.in1[0] <== base[0];
  58. adr7.in1[1] <== base[1];
  59. adr7.in2[0] <== adr6.out[0];
  60. adr7.in2[1] <== adr6.out[1];
  61. mux.c[0][6] <== adr7.out[0];
  62. mux.c[1][6] <== adr7.out[1];
  63. // in[7] -> 8*BASE
  64. adr8.in1[0] <== base[0];
  65. adr8.in1[1] <== base[1];
  66. adr8.in2[0] <== adr7.out[0];
  67. adr8.in2[1] <== adr7.out[1];
  68. mux.c[0][7] <== adr8.out[0];
  69. mux.c[1][7] <== adr8.out[1];
  70. out8[0] <== adr8.out[0];
  71. out8[1] <== adr8.out[1];
  72. out[0] <== mux.out[0];
  73. out[1] <== - mux.out[1]*2*in[3] + mux.out[1]; // Negate y if in[3] is one
  74. }
  75. template Segment(nWindows) {
  76. signal input in[nWindows*4];
  77. signal input base[2];
  78. signal output out[2];
  79. var i;
  80. var j;
  81. // Convert the base to montgomery
  82. component e2m = Edwards2Montgomery();
  83. e2m.in[0] <== base[0];
  84. e2m.in[1] <== base[1];
  85. component windows[nWindows];
  86. component doublers1[nWindows-1];
  87. component doublers2[nWindows-1];
  88. component adders[nWindows-1];
  89. for (i=0; i<nWindows; i++) {
  90. windows[i] = Window4();
  91. if (i==0) {
  92. windows[i].base[0] <== e2m.out[0];
  93. windows[i].base[1] <== e2m.out[1];
  94. } else {
  95. doublers1[i-1] = MontgomeryDouble();
  96. doublers2[i-1] = MontgomeryDouble();
  97. doublers1[i-1].in[0] <== windows[i-1].out8[0];
  98. doublers1[i-1].in[1] <== windows[i-1].out8[1];
  99. doublers2[i-1].in[0] <== doublers1[i-1].out[0];
  100. doublers2[i-1].in[1] <== doublers1[i-1].out[1];
  101. windows[i].base[0] <== doublers2[i-1].out[0];
  102. windows[i].base[1] <== doublers2[i-1].out[1];
  103. adders[i-1] = MontgomeryAdd();
  104. if (i==1) {
  105. adders[i-1].in1[0] <== windows[0].out[0];
  106. adders[i-1].in1[1] <== windows[0].out[1];
  107. } else {
  108. adders[i-1].in1[0] <== adders[i-2].out[0];
  109. adders[i-1].in1[1] <== adders[i-2].out[1];
  110. }
  111. adders[i-1].in2[0] <== windows[i].out[0];
  112. adders[i-1].in2[1] <== windows[i].out[1];
  113. }
  114. for (j=0; j<4; j++) {
  115. windows[i].in[j] <== in[4*i+j];
  116. }
  117. }
  118. component m2e = Montgomery2Edwards();
  119. if (nWindows > 1) {
  120. m2e.in[0] <== adders[nWindows-2].out[0];
  121. m2e.in[1] <== adders[nWindows-2].out[1];
  122. } else {
  123. m2e.in[0] <== windows[0].out[0];
  124. m2e.in[1] <== windows[0].out[1];
  125. }
  126. out[0] <== m2e.out[0];
  127. out[1] <== m2e.out[1];
  128. }
  129. template Pedersen(n) {
  130. signal input in[n];
  131. signal output out[2];
  132. var BASE = [
  133. [10457101036533406547632367118273992217979173478358440826365724437999023779287,19824078218392094440610104313265183977899662750282163392862422243483260492317],
  134. [2671756056509184035029146175565761955751135805354291559563293617232983272177,2663205510731142763556352975002641716101654201788071096152948830924149045094],
  135. [5802099305472655231388284418920769829666717045250560929368476121199858275951,5980429700218124965372158798884772646841287887664001482443826541541529227896],
  136. [7107336197374528537877327281242680114152313102022415488494307685842428166594,2857869773864086953506483169737724679646433914307247183624878062391496185654],
  137. [20265828622013100949498132415626198973119240347465898028410217039057588424236,1160461593266035632937973507065134938065359936056410650153315956301179689506],
  138. [1487999857809287756929114517587739322941449154962237464737694709326309567994,14017256862867289575056460215526364897734808720610101650676790868051368668003],
  139. [14618644331049802168996997831720384953259095788558646464435263343433563860015,13115243279999696210147231297848654998887864576952244320558158620692603342236],
  140. [6814338563135591367010655964669793483652536871717891893032616415581401894627,13660303521961041205824633772157003587453809761793065294055279768121314853695],
  141. [3571615583211663069428808372184817973703476260057504149923239576077102575715,11981351099832644138306422070127357074117642951423551606012551622164230222506],
  142. [18597552580465440374022635246985743886550544261632147935254624835147509493269,6753322320275422086923032033899357299485124665258735666995435957890214041481]
  143. ]
  144. var nSegments = ((n-1)\200)+1;
  145. component segments[nSegments];
  146. var i;
  147. var j;
  148. var nBits;
  149. var nWindows;
  150. for (i=0; i<nSegments; i++) {
  151. nBits = (i == (nSegments-1)) ? n - (nSegments-1)*200 : 200;
  152. nWindows = ((nBits - 1)\4)+1;
  153. segments[i] = Segment(nWindows);
  154. segments[i].base[0] <== BASE[i][0];
  155. segments[i].base[1] <== BASE[i][1];
  156. for (j = 0; j<nBits; j++) {
  157. segments[i].in[j] <== in[i*200+j];
  158. }
  159. // Fill padding bits
  160. for (j = nBits; j < nWindows*4; j++) {
  161. segments[i].in[j] <== 0;
  162. }
  163. }
  164. component adders[nSegments-1];
  165. for (i=0; i<nSegments-1; i++) {
  166. adders[i] = BabyAdd();
  167. if (i==0) {
  168. adders[i].x1 <== segments[0].out[0];
  169. adders[i].y1 <== segments[0].out[1];
  170. adders[i].x2 <== segments[1].out[0];
  171. adders[i].y2 <== segments[1].out[1];
  172. } else {
  173. adders[i].x1 <== adders[i-1].xout;
  174. adders[i].y1 <== adders[i-1].yout;
  175. adders[i].x2 <== segments[i+1].out[0];
  176. adders[i].y2 <== segments[i+1].out[1];
  177. }
  178. }
  179. /*
  180. coponent packPoint = PackPoint();
  181. if (nSegments>1) {
  182. packPoint.in[0] <== adders[nSegments-2].xout;
  183. packPoint.in[1] <== adders[nSegments-2].yout;
  184. } else {
  185. packPoint.in[0] <== segments[0].out[0];
  186. packPoint.in[1] <== segments[0].out[1];
  187. }
  188. out[0] <== packPoint.out[0];
  189. out[1] <== packPoint.out[1];
  190. */
  191. if (nSegments>1) {
  192. out[0] <== adders[nSegments-2].xout;
  193. out[1] <== adders[nSegments-2].yout;
  194. } else {
  195. out[0] <== segments[0].out[0];
  196. out[1] <== segments[0].out[1];
  197. }
  198. }