1* compconstant - Returns 1 if `in` (expanded to binary array) > `ct`
 2* aliascheck - check if `in` (expanded to binary array) oveflowed its 254 bits (<= -1)
 3* babyjub - twisted Edwards curve 168700.x^2 + y^2 = 1 + 168696.x^2.y^2
 4  * BabyAdd - (`xout`,`yout`) = (`x1`,`y1`) + (`x2`,`y2`)
 5  * BabyDbl - (`xout`,`yout`) = 2*(`x`,`y`)
 6  * BabyCheck - check that (`x`,`y`) is on the curve
 7* binsub - binary subtraction
 8* gates - logical gates
 9* mimc - SNARK-friendly hash Minimal Multiplicative Complexity.
10  * https://eprint.iacr.org/2016/492.pdf
11  * zcash/zcash#2233
12* smt - Sparse Merkle Tree
13  * https://ethresear.ch/t/optimizing-sparse-merkle-trees/3751
14* montgomery https://en.wikipedia.org/wiki/Montgomery_curve