PRCYCoin  2.0.0.7rc1
P2P Digital Currency
group_impl.h
Go to the documentation of this file.
1 /**********************************************************************
2  * Copyright (c) 2013, 2014 Pieter Wuille *
3  * Distributed under the MIT software license, see the accompanying *
4  * file COPYING or http://www.opensource.org/licenses/mit-license.php.*
5  **********************************************************************/
6 
7 #ifndef _SECP256K1_GROUP_IMPL_H_
8 #define _SECP256K1_GROUP_IMPL_H_
9 
10 #include <string.h>
11 
12 #include "num.h"
13 #include "field.h"
14 #include "group.h"
15 
16 static void secp256k1_ge_set_infinity(secp256k1_ge_t *r) {
17  r->infinity = 1;
18 }
19 
20 static void secp256k1_ge_set_xy(secp256k1_ge_t *r, const secp256k1_fe_t *x, const secp256k1_fe_t *y) {
21  r->infinity = 0;
22  r->x = *x;
23  r->y = *y;
24 }
25 
26 static int secp256k1_ge_is_infinity(const secp256k1_ge_t *a) {
27  return a->infinity;
28 }
29 
30 static void secp256k1_ge_neg(secp256k1_ge_t *r, const secp256k1_ge_t *a) {
31  r->infinity = a->infinity;
32  r->x = a->x;
33  r->y = a->y;
34  secp256k1_fe_normalize(&r->y);
35  secp256k1_fe_negate(&r->y, &r->y, 1);
36 }
37 
38 static void secp256k1_ge_get_hex(char *r, int *rlen, const secp256k1_ge_t *a) {
39  char cx[65]; int lx=65;
40  char cy[65]; int ly=65;
41  secp256k1_fe_get_hex(cx, &lx, &a->x);
42  secp256k1_fe_get_hex(cy, &ly, &a->y);
43  lx = strlen(cx);
44  ly = strlen(cy);
45  int len = lx + ly + 3 + 1;
46  if (*rlen < len) {
47  *rlen = len;
48  return;
49  }
50  *rlen = len;
51  r[0] = '(';
52  memcpy(r+1, cx, lx);
53  r[1+lx] = ',';
54  memcpy(r+2+lx, cy, ly);
55  r[2+lx+ly] = ')';
56  r[3+lx+ly] = 0;
57 }
58 
59 static void secp256k1_ge_set_gej(secp256k1_ge_t *r, secp256k1_gej_t *a) {
60  r->infinity = a->infinity;
61  secp256k1_fe_inv(&a->z, &a->z);
62  secp256k1_fe_t z2; secp256k1_fe_sqr(&z2, &a->z);
63  secp256k1_fe_t z3; secp256k1_fe_mul(&z3, &a->z, &z2);
64  secp256k1_fe_mul(&a->x, &a->x, &z2);
65  secp256k1_fe_mul(&a->y, &a->y, &z3);
66  secp256k1_fe_set_int(&a->z, 1);
67  r->x = a->x;
68  r->y = a->y;
69 }
70 
71 static void secp256k1_ge_set_gej_var(secp256k1_ge_t *r, secp256k1_gej_t *a) {
72  r->infinity = a->infinity;
73  if (a->infinity) {
74  return;
75  }
76  secp256k1_fe_inv_var(&a->z, &a->z);
77  secp256k1_fe_t z2; secp256k1_fe_sqr(&z2, &a->z);
78  secp256k1_fe_t z3; secp256k1_fe_mul(&z3, &a->z, &z2);
79  secp256k1_fe_mul(&a->x, &a->x, &z2);
80  secp256k1_fe_mul(&a->y, &a->y, &z3);
81  secp256k1_fe_set_int(&a->z, 1);
82  r->x = a->x;
83  r->y = a->y;
84 }
85 
86 static void secp256k1_ge_set_all_gej_var(size_t len, secp256k1_ge_t r[len], const secp256k1_gej_t a[len]) {
87  size_t count = 0;
88  secp256k1_fe_t az[len];
89  for (size_t i=0; i<len; i++) {
90  if (!a[i].infinity) {
91  az[count++] = a[i].z;
92  }
93  }
94 
95  secp256k1_fe_t azi[count];
96  secp256k1_fe_inv_all_var(count, azi, az);
97 
98  count = 0;
99  for (size_t i=0; i<len; i++) {
100  r[i].infinity = a[i].infinity;
101  if (!a[i].infinity) {
102  secp256k1_fe_t *zi = &azi[count++];
103  secp256k1_fe_t zi2; secp256k1_fe_sqr(&zi2, zi);
104  secp256k1_fe_t zi3; secp256k1_fe_mul(&zi3, &zi2, zi);
105  secp256k1_fe_mul(&r[i].x, &a[i].x, &zi2);
106  secp256k1_fe_mul(&r[i].y, &a[i].y, &zi3);
107  }
108  }
109 }
110 
111 static void secp256k1_gej_set_infinity(secp256k1_gej_t *r) {
112  r->infinity = 1;
113  secp256k1_fe_set_int(&r->x, 0);
114  secp256k1_fe_set_int(&r->y, 0);
115  secp256k1_fe_set_int(&r->z, 0);
116 }
117 
118 static void secp256k1_gej_set_xy(secp256k1_gej_t *r, const secp256k1_fe_t *x, const secp256k1_fe_t *y) {
119  r->infinity = 0;
120  r->x = *x;
121  r->y = *y;
122  secp256k1_fe_set_int(&r->z, 1);
123 }
124 
125 static void secp256k1_gej_clear(secp256k1_gej_t *r) {
126  r->infinity = 0;
127  secp256k1_fe_clear(&r->x);
128  secp256k1_fe_clear(&r->y);
129  secp256k1_fe_clear(&r->z);
130 }
131 
132 static void secp256k1_ge_clear(secp256k1_ge_t *r) {
133  r->infinity = 0;
134  secp256k1_fe_clear(&r->x);
135  secp256k1_fe_clear(&r->y);
136 }
137 
138 static int secp256k1_ge_set_xo(secp256k1_ge_t *r, const secp256k1_fe_t *x, int odd) {
139  r->x = *x;
140  secp256k1_fe_t x2; secp256k1_fe_sqr(&x2, x);
141  secp256k1_fe_t x3; secp256k1_fe_mul(&x3, x, &x2);
142  r->infinity = 0;
143  secp256k1_fe_t c; secp256k1_fe_set_int(&c, 7);
144  secp256k1_fe_add(&c, &x3);
145  if (!secp256k1_fe_sqrt(&r->y, &c))
146  return 0;
147  secp256k1_fe_normalize(&r->y);
148  if (secp256k1_fe_is_odd(&r->y) != odd)
149  secp256k1_fe_negate(&r->y, &r->y, 1);
150  return 1;
151 }
152 
153 static void secp256k1_gej_set_ge(secp256k1_gej_t *r, const secp256k1_ge_t *a) {
154  r->infinity = a->infinity;
155  r->x = a->x;
156  r->y = a->y;
157  secp256k1_fe_set_int(&r->z, 1);
158 }
159 
160 static void secp256k1_gej_get_x_var(secp256k1_fe_t *r, const secp256k1_gej_t *a) {
161  secp256k1_fe_t zi2; secp256k1_fe_inv_var(&zi2, &a->z); secp256k1_fe_sqr(&zi2, &zi2);
162  secp256k1_fe_mul(r, &a->x, &zi2);
163 }
164 
165 static void secp256k1_gej_neg(secp256k1_gej_t *r, const secp256k1_gej_t *a) {
166  r->infinity = a->infinity;
167  r->x = a->x;
168  r->y = a->y;
169  r->z = a->z;
170  secp256k1_fe_normalize(&r->y);
171  secp256k1_fe_negate(&r->y, &r->y, 1);
172 }
173 
174 static int secp256k1_gej_is_infinity(const secp256k1_gej_t *a) {
175  return a->infinity;
176 }
177 
178 static int secp256k1_gej_is_valid(const secp256k1_gej_t *a) {
179  if (a->infinity)
180  return 0;
186  secp256k1_fe_t y2; secp256k1_fe_sqr(&y2, &a->y);
187  secp256k1_fe_t x3; secp256k1_fe_sqr(&x3, &a->x); secp256k1_fe_mul(&x3, &x3, &a->x);
188  secp256k1_fe_t z2; secp256k1_fe_sqr(&z2, &a->z);
189  secp256k1_fe_t z6; secp256k1_fe_sqr(&z6, &z2); secp256k1_fe_mul(&z6, &z6, &z2);
190  secp256k1_fe_mul_int(&z6, 7);
191  secp256k1_fe_add(&x3, &z6);
192  secp256k1_fe_normalize(&y2);
193  secp256k1_fe_normalize(&x3);
194  return secp256k1_fe_equal(&y2, &x3);
195 }
196 
197 static int secp256k1_ge_is_valid(const secp256k1_ge_t *a) {
198  if (a->infinity)
199  return 0;
200  /* y^2 = x^3 + 7 */
201  secp256k1_fe_t y2; secp256k1_fe_sqr(&y2, &a->y);
202  secp256k1_fe_t x3; secp256k1_fe_sqr(&x3, &a->x); secp256k1_fe_mul(&x3, &x3, &a->x);
203  secp256k1_fe_t c; secp256k1_fe_set_int(&c, 7);
204  secp256k1_fe_add(&x3, &c);
205  secp256k1_fe_normalize(&y2);
206  secp256k1_fe_normalize(&x3);
207  return secp256k1_fe_equal(&y2, &x3);
208 }
209 
210 static void secp256k1_gej_double_var(secp256k1_gej_t *r, const secp256k1_gej_t *a) {
211  // For secp256k1, 2Q is infinity if and only if Q is infinity. This is because if 2Q = infinity,
212  // Q must equal -Q, or that Q.y == -(Q.y), or Q.y is 0. For a point on y^2 = x^3 + 7 to have
213  // y=0, x^3 must be -7 mod p. However, -7 has no cube root mod p.
214  r->infinity = a->infinity;
215  if (r->infinity) {
216  return;
217  }
218 
219  secp256k1_fe_t t1,t2,t3,t4;
220  secp256k1_fe_mul(&r->z, &a->z, &a->y);
221  secp256k1_fe_mul_int(&r->z, 2); /* Z' = 2*Y*Z (2) */
222  secp256k1_fe_sqr(&t1, &a->x);
223  secp256k1_fe_mul_int(&t1, 3); /* T1 = 3*X^2 (3) */
224  secp256k1_fe_sqr(&t2, &t1); /* T2 = 9*X^4 (1) */
225  secp256k1_fe_sqr(&t3, &a->y);
226  secp256k1_fe_mul_int(&t3, 2); /* T3 = 2*Y^2 (2) */
227  secp256k1_fe_sqr(&t4, &t3);
228  secp256k1_fe_mul_int(&t4, 2); /* T4 = 8*Y^4 (2) */
229  secp256k1_fe_mul(&t3, &t3, &a->x); /* T3 = 2*X*Y^2 (1) */
230  r->x = t3;
231  secp256k1_fe_mul_int(&r->x, 4); /* X' = 8*X*Y^2 (4) */
232  secp256k1_fe_negate(&r->x, &r->x, 4); /* X' = -8*X*Y^2 (5) */
233  secp256k1_fe_add(&r->x, &t2); /* X' = 9*X^4 - 8*X*Y^2 (6) */
234  secp256k1_fe_negate(&t2, &t2, 1); /* T2 = -9*X^4 (2) */
235  secp256k1_fe_mul_int(&t3, 6); /* T3 = 12*X*Y^2 (6) */
236  secp256k1_fe_add(&t3, &t2); /* T3 = 12*X*Y^2 - 9*X^4 (8) */
237  secp256k1_fe_mul(&r->y, &t1, &t3); /* Y' = 36*X^3*Y^2 - 27*X^6 (1) */
238  secp256k1_fe_negate(&t2, &t4, 2); /* T2 = -8*Y^4 (3) */
239  secp256k1_fe_add(&r->y, &t2); /* Y' = 36*X^3*Y^2 - 27*X^6 - 8*Y^4 (4) */
240 }
241 
242 static void secp256k1_gej_add_var(secp256k1_gej_t *r, const secp256k1_gej_t *a, const secp256k1_gej_t *b) {
243  if (a->infinity) {
244  *r = *b;
245  return;
246  }
247  if (b->infinity) {
248  *r = *a;
249  return;
250  }
251  r->infinity = 0;
252  secp256k1_fe_t z22; secp256k1_fe_sqr(&z22, &b->z);
253  secp256k1_fe_t z12; secp256k1_fe_sqr(&z12, &a->z);
254  secp256k1_fe_t u1; secp256k1_fe_mul(&u1, &a->x, &z22);
255  secp256k1_fe_t u2; secp256k1_fe_mul(&u2, &b->x, &z12);
256  secp256k1_fe_t s1; secp256k1_fe_mul(&s1, &a->y, &z22); secp256k1_fe_mul(&s1, &s1, &b->z);
257  secp256k1_fe_t s2; secp256k1_fe_mul(&s2, &b->y, &z12); secp256k1_fe_mul(&s2, &s2, &a->z);
258  secp256k1_fe_normalize(&u1);
259  secp256k1_fe_normalize(&u2);
260  if (secp256k1_fe_equal(&u1, &u2)) {
261  secp256k1_fe_normalize(&s1);
262  secp256k1_fe_normalize(&s2);
263  if (secp256k1_fe_equal(&s1, &s2)) {
264  secp256k1_gej_double_var(r, a);
265  } else {
266  r->infinity = 1;
267  }
268  return;
269  }
270  secp256k1_fe_t h; secp256k1_fe_negate(&h, &u1, 1); secp256k1_fe_add(&h, &u2);
271  secp256k1_fe_t i; secp256k1_fe_negate(&i, &s1, 1); secp256k1_fe_add(&i, &s2);
272  secp256k1_fe_t i2; secp256k1_fe_sqr(&i2, &i);
273  secp256k1_fe_t h2; secp256k1_fe_sqr(&h2, &h);
274  secp256k1_fe_t h3; secp256k1_fe_mul(&h3, &h, &h2);
275  secp256k1_fe_mul(&r->z, &a->z, &b->z); secp256k1_fe_mul(&r->z, &r->z, &h);
276  secp256k1_fe_t t; secp256k1_fe_mul(&t, &u1, &h2);
277  r->x = t; secp256k1_fe_mul_int(&r->x, 2); secp256k1_fe_add(&r->x, &h3); secp256k1_fe_negate(&r->x, &r->x, 3); secp256k1_fe_add(&r->x, &i2);
278  secp256k1_fe_negate(&r->y, &r->x, 5); secp256k1_fe_add(&r->y, &t); secp256k1_fe_mul(&r->y, &r->y, &i);
279  secp256k1_fe_mul(&h3, &h3, &s1); secp256k1_fe_negate(&h3, &h3, 1);
280  secp256k1_fe_add(&r->y, &h3);
281 }
282 
283 static void secp256k1_gej_add_ge_var(secp256k1_gej_t *r, const secp256k1_gej_t *a, const secp256k1_ge_t *b) {
284  if (a->infinity) {
285  r->infinity = b->infinity;
286  r->x = b->x;
287  r->y = b->y;
288  secp256k1_fe_set_int(&r->z, 1);
289  return;
290  }
291  if (b->infinity) {
292  *r = *a;
293  return;
294  }
295  r->infinity = 0;
296  secp256k1_fe_t z12; secp256k1_fe_sqr(&z12, &a->z);
297  secp256k1_fe_t u1 = a->x; secp256k1_fe_normalize(&u1);
298  secp256k1_fe_t u2; secp256k1_fe_mul(&u2, &b->x, &z12);
299  secp256k1_fe_t s1 = a->y; secp256k1_fe_normalize(&s1);
300  secp256k1_fe_t s2; secp256k1_fe_mul(&s2, &b->y, &z12); secp256k1_fe_mul(&s2, &s2, &a->z);
301  secp256k1_fe_normalize(&u1);
302  secp256k1_fe_normalize(&u2);
303  if (secp256k1_fe_equal(&u1, &u2)) {
304  secp256k1_fe_normalize(&s1);
305  secp256k1_fe_normalize(&s2);
306  if (secp256k1_fe_equal(&s1, &s2)) {
307  secp256k1_gej_double_var(r, a);
308  } else {
309  r->infinity = 1;
310  }
311  return;
312  }
313  secp256k1_fe_t h; secp256k1_fe_negate(&h, &u1, 1); secp256k1_fe_add(&h, &u2);
314  secp256k1_fe_t i; secp256k1_fe_negate(&i, &s1, 1); secp256k1_fe_add(&i, &s2);
315  secp256k1_fe_t i2; secp256k1_fe_sqr(&i2, &i);
316  secp256k1_fe_t h2; secp256k1_fe_sqr(&h2, &h);
317  secp256k1_fe_t h3; secp256k1_fe_mul(&h3, &h, &h2);
318  r->z = a->z; secp256k1_fe_mul(&r->z, &r->z, &h);
319  secp256k1_fe_t t; secp256k1_fe_mul(&t, &u1, &h2);
320  r->x = t; secp256k1_fe_mul_int(&r->x, 2); secp256k1_fe_add(&r->x, &h3); secp256k1_fe_negate(&r->x, &r->x, 3); secp256k1_fe_add(&r->x, &i2);
321  secp256k1_fe_negate(&r->y, &r->x, 5); secp256k1_fe_add(&r->y, &t); secp256k1_fe_mul(&r->y, &r->y, &i);
322  secp256k1_fe_mul(&h3, &h3, &s1); secp256k1_fe_negate(&h3, &h3, 1);
323  secp256k1_fe_add(&r->y, &h3);
324 }
325 
326 static void secp256k1_gej_add_ge(secp256k1_gej_t *r, const secp256k1_gej_t *a, const secp256k1_ge_t *b) {
327  VERIFY_CHECK(!b->infinity);
328  VERIFY_CHECK(a->infinity == 0 || a->infinity == 1);
329 
352  secp256k1_fe_t zz; secp256k1_fe_sqr(&zz, &a->z); /* z = Z1^2 */
353  secp256k1_fe_t u1 = a->x; secp256k1_fe_normalize(&u1); /* u1 = U1 = X1*Z2^2 (1) */
354  secp256k1_fe_t u2; secp256k1_fe_mul(&u2, &b->x, &zz); /* u2 = U2 = X2*Z1^2 (1) */
355  secp256k1_fe_t s1 = a->y; secp256k1_fe_normalize(&s1); /* s1 = S1 = Y1*Z2^3 (1) */
356  secp256k1_fe_t s2; secp256k1_fe_mul(&s2, &b->y, &zz); /* s2 = Y2*Z2^2 (1) */
357  secp256k1_fe_mul(&s2, &s2, &a->z); /* s2 = S2 = Y2*Z1^3 (1) */
358  secp256k1_fe_t z = a->z; /* z = Z = Z1*Z2 (8) */
359  secp256k1_fe_t t = u1; secp256k1_fe_add(&t, &u2); /* t = T = U1+U2 (2) */
360  secp256k1_fe_t m = s1; secp256k1_fe_add(&m, &s2); /* m = M = S1+S2 (2) */
361  secp256k1_fe_t n; secp256k1_fe_sqr(&n, &m); /* n = M^2 (1) */
362  secp256k1_fe_t q; secp256k1_fe_mul(&q, &n, &t); /* q = Q = T*M^2 (1) */
363  secp256k1_fe_sqr(&n, &n); /* n = M^4 (1) */
364  secp256k1_fe_t rr; secp256k1_fe_sqr(&rr, &t); /* rr = T^2 (1) */
365  secp256k1_fe_mul(&t, &u1, &u2); secp256k1_fe_negate(&t, &t, 1); /* t = -U1*U2 (2) */
366  secp256k1_fe_add(&rr, &t); /* rr = R = T^2-U1*U2 (3) */
367  secp256k1_fe_sqr(&t, &rr); /* t = R^2 (1) */
368  secp256k1_fe_mul(&r->z, &m, &z); /* r->z = M*Z (1) */
369  secp256k1_fe_normalize(&r->z);
370  int infinity = secp256k1_fe_is_zero(&r->z) * (1 - a->infinity);
371  secp256k1_fe_mul_int(&r->z, 2 * (1 - a->infinity)); /* r->z = Z3 = 2*M*Z (2) */
372  r->x = t; /* r->x = R^2 (1) */
373  secp256k1_fe_negate(&q, &q, 1); /* q = -Q (2) */
374  secp256k1_fe_add(&r->x, &q); /* r->x = R^2-Q (3) */
375  secp256k1_fe_normalize(&r->x);
376  secp256k1_fe_mul_int(&q, 3); /* q = -3*Q (6) */
377  secp256k1_fe_mul_int(&t, 2); /* t = 2*R^2 (2) */
378  secp256k1_fe_add(&t, &q); /* t = 2*R^2-3*Q (8) */
379  secp256k1_fe_mul(&t, &t, &rr); /* t = R*(2*R^2-3*Q) (1) */
380  secp256k1_fe_add(&t, &n); /* t = R*(2*R^2-3*Q)+M^4 (2) */
381  secp256k1_fe_negate(&r->y, &t, 2); /* r->y = R*(3*Q-2*R^2)-M^4 (3) */
382  secp256k1_fe_normalize(&r->y);
383  secp256k1_fe_mul_int(&r->x, 4 * (1 - a->infinity)); /* r->x = X3 = 4*(R^2-Q) */
384  secp256k1_fe_mul_int(&r->y, 4 * (1 - a->infinity)); /* r->y = Y3 = 4*R*(3*Q-2*R^2)-4*M^4 (4) */
385 
389  t = b->x; secp256k1_fe_mul_int(&t, a->infinity);
390  secp256k1_fe_add(&r->x, &t);
391  t = b->y; secp256k1_fe_mul_int(&t, a->infinity);
392  secp256k1_fe_add(&r->y, &t);
393  secp256k1_fe_set_int(&t, a->infinity);
394  secp256k1_fe_add(&r->z, &t);
395  r->infinity = infinity;
396 }
397 
398 
399 
400 static void secp256k1_gej_get_hex(char *r, int *rlen, const secp256k1_gej_t *a) {
401  secp256k1_gej_t c = *a;
402  secp256k1_ge_t t; secp256k1_ge_set_gej(&t, &c);
403  secp256k1_ge_get_hex(r, rlen, &t);
404 }
405 
406 #ifdef USE_ENDOMORPHISM
407 static void secp256k1_gej_mul_lambda(secp256k1_gej_t *r, const secp256k1_gej_t *a) {
408  const secp256k1_fe_t *beta = &secp256k1_ge_consts->beta;
409  *r = *a;
410  secp256k1_fe_mul(&r->x, &r->x, beta);
411 }
412 #endif
413 
414 static void secp256k1_ge_start(void) {
415  static const unsigned char secp256k1_ge_consts_g_x[] = {
416  0x79,0xBE,0x66,0x7E,0xF9,0xDC,0xBB,0xAC,
417  0x55,0xA0,0x62,0x95,0xCE,0x87,0x0B,0x07,
418  0x02,0x9B,0xFC,0xDB,0x2D,0xCE,0x28,0xD9,
419  0x59,0xF2,0x81,0x5B,0x16,0xF8,0x17,0x98
420  };
421  static const unsigned char secp256k1_ge_consts_g_y[] = {
422  0x48,0x3A,0xDA,0x77,0x26,0xA3,0xC4,0x65,
423  0x5D,0xA4,0xFB,0xFC,0x0E,0x11,0x08,0xA8,
424  0xFD,0x17,0xB4,0x48,0xA6,0x85,0x54,0x19,
425  0x9C,0x47,0xD0,0x8F,0xFB,0x10,0xD4,0xB8
426  };
427 #ifdef USE_ENDOMORPHISM
428  /* properties of secp256k1's efficiently computable endomorphism */
429  static const unsigned char secp256k1_ge_consts_beta[] = {
430  0x7a,0xe9,0x6a,0x2b,0x65,0x7c,0x07,0x10,
431  0x6e,0x64,0x47,0x9e,0xac,0x34,0x34,0xe9,
432  0x9c,0xf0,0x49,0x75,0x12,0xf5,0x89,0x95,
433  0xc1,0x39,0x6c,0x28,0x71,0x95,0x01,0xee
434  };
435 #endif
436  if (secp256k1_ge_consts == NULL) {
438 #ifdef USE_ENDOMORPHISM
439  VERIFY_CHECK(secp256k1_fe_set_b32(&ret->beta, secp256k1_ge_consts_beta));
440 #endif
441  secp256k1_fe_t g_x, g_y;
442  VERIFY_CHECK(secp256k1_fe_set_b32(&g_x, secp256k1_ge_consts_g_x));
443  VERIFY_CHECK(secp256k1_fe_set_b32(&g_y, secp256k1_ge_consts_g_y));
444  secp256k1_ge_set_xy(&ret->g, &g_x, &g_y);
445  secp256k1_ge_consts = ret;
446  }
447 }
448 
449 static void secp256k1_ge_stop(void) {
450  if (secp256k1_ge_consts != NULL) {
451  secp256k1_ge_consts_t *c = (secp256k1_ge_consts_t*)secp256k1_ge_consts;
452  free((void*)c);
453  secp256k1_ge_consts = NULL;
454  }
455 }
456 
457 #endif
VERIFY_CHECK
#define VERIFY_CHECK(cond)
Definition: util.h:61
b
void const uint64_t * b
Definition: field_5x52_asm_impl.h:10
secp256k1_gej_t
A group element of the secp256k1 curve, in jacobian coordinates.
Definition: group.h:21
secp256k1_ge_t::infinity
int infinity
Definition: group.h:21
memcpy
void * memcpy(void *a, const void *b, size_t c)
Definition: glibc_compat.cpp:15
secp256k1_ge_t::y
secp256k1_fe_t y
Definition: group.h:20
r
void const uint64_t uint64_t * r
Definition: field_5x52_asm_impl.h:10
group.h
secp256k1_ge_consts_t
Global constants related to the group.
Definition: group.h:29
secp256k1_fe_t
Definition: field_10x26.h:12
secp256k1_gej_t::infinity
int infinity
Definition: group.h:25
secp256k1_gej_t::z
secp256k1_fe_t z
Definition: group.h:24
secp256k1_gej_t::x
secp256k1_fe_t x
Definition: group.h:22
num.h
secp256k1_gej_t::y
secp256k1_fe_t y
Definition: group.h:23
secp256k1_ge_t::x
secp256k1_fe_t x
Definition: group.h:19
secp256k1_ge_t
A group element of the secp256k1 curve, in affine coordinates.
Definition: group.h:14
secp256k1_ge_consts_t::g
secp256k1_ge_t g
Definition: group.h:30
field.h