Precondition ------------- |f0|, |f2|, |f4|, |f6|, |f8| < 1.65 * 2^26 |f1|, |f3|, |f5|, |f7|, |f9| < 1.65 * 2^25 |g0|, |g2|, |g4|, |g6|, |g8| <

Precondition ------------- |f0|, |f2|, |f4|, |f6|, |f8| < 1.65 * 2^26 |f1|, |f3|, |f5|, |f7|, |f9| < 1.65 * 2^25 Note: we could use fe_mul() for

get bit from scalar at position i

updates a Blake2 hash with a 32 bit word, little endian.

Precondition |h[0]|, |h[2]|, |h[4]|, |h[6]|, |h[8]| < 1.1 * 2^25 |h[1]|, |h[3]|, |h[5]|, |h[7]|, |h[9]| < 1.1 * 2^24 Therefore, |h| < 2^255-19 Th

read a num bit value from a stream and add base */

* UNKNOWN support for altitude * * @param alt altitude */

trim a scalar for scalar multiplication

get parameter as a float */

* When latitude and longitude are 0, set to UNKNOWN * * @param lat latitude * @param lon longitude * @param select 0:latitude 1:longitude */

returns the smallest positive integer y such that (x + y) % pow_2 == 0 Basically, it's how many bytes we need to add to "align" x. Only works when po

Inverting means multiplying by 2^255 - 21 2^255 - 21 = (2^252 - 3) * 8 + 3 So we reuse the multiplication chain of fe_pow22523

Precondition ------------- |f0|, |f2|, |f4|, |f6|, |f8| < 1.65 * 2^26 |f1|, |f3|, |f5|, |f7|, |f9| < 1.65 * 2^25 |g0|, |g2|, |g4|, |g6|, |g8| <

p = a*b + p

Hash with a virtually unlimited digest size. Doesn't extract more entropy than the base hash function. Mainly used for filling a whole kilobyte block

Returns 1 if equal, 0 if not equal

Parity check. Returns 0 if even, 1 if odd

Core of the compression function G. Computes Z from R in place.

Internal buffers are not wiped! Inputs must not be secret! => Use only to *check* signatures.

p = [scalar]B, where B is the base point

return a public key */