83836a9547
If you compile without ./configure --enable-exhaustive-tests=no, this will create a binary ./exhaustive_tests which will execute every function possible on a group of small order obtained by moving to a twist of our curve and locating a generator of small order. Currently defaults to order 13, though by changing some #ifdefs you can get a couple other ones. (Currently 199, which will take forever to run, and 14, which won't work because it's composite.) TODO exhaustive tests for the various modules
16 lines
554 B
C
16 lines
554 B
C
/**********************************************************************
|
|
* Copyright (c) 2015 Andrew Poelstra *
|
|
* Distributed under the MIT software license, see the accompanying *
|
|
* file COPYING or http://www.opensource.org/licenses/mit-license.php.*
|
|
**********************************************************************/
|
|
|
|
#ifndef _SECP256K1_SCALAR_REPR_
|
|
#define _SECP256K1_SCALAR_REPR_
|
|
|
|
#include <stdint.h>
|
|
|
|
/** A scalar modulo the group order of the secp256k1 curve. */
|
|
typedef uint32_t secp256k1_scalar;
|
|
|
|
#endif
|