bend-collections

Search uses release 1.0.0.0 · 4,483 definitions

Releases (1)

def runThe first register is looked at before the program runs, so that the proof checker stops at once on unknown inputs (the result is run_go's).
def add_progRCB 2016 Algorithm 7 (a = 0): registers X1 Y1 Z1 X2 Y2 Z2 b3 = 0..6; the result is X3 Y3 Z3 = registers 33, 36, 39.
def dbl_progRCB 2016 Algorithm 9 (a = 0): registers X Y Z b3 = 0..3; the result is X3 Y3 Z3 = registers 21, 18, 13.
def b3
def add_out
def add
def dbl_out
def dbl
def infinity
def neg
def selectb ?
def step
def mul_go
def mul[k] p for a scalar k given by its 16 limbs (any value below 2^256)
def gx
def gy
def gthe generator G of SEC 2
def is_inf
type Affine
def to_affine_z
def to_affine(X / Z, Y / Z); (0, 0) for the point at infinity
def aff_x
def aff_y
def rhsx^3 + 7
def on_curve
def lift_ythe square root of x^3 + 7 with the given parity, if x^3 + 7 is a square
def decompress_if
def decompress
def decode_c
def decode_u
def decode_33
def decode_65
def decode_len
def decodeSEC 1 section 2.3.4: a compressed (33 bytes, prefix 02/03) or uncompressed (65 bytes, prefix 04) public key, None when malformed, not below p, or not on the curve (the point at infinity, encoded 00, is refused)
def enc_cSEC 1 section 2.3.3
def encode_compressed
def enc_u
def encode_uncompressed

def c2^256 - n, in radix 2^16
def reduce_u
def reduce
def zero
def small
def one
def add_u
def add_b
def add
def neg_u
def neg(one argument: nothing to look at first)
def mul_u
def mul_b
def mul
def pow_step
def pow_go
def powx is looked at first, so that on an unknown x nothing is unfolded
def inv_bitsthe bits of n - 2, most significant first (the proofs show they are those of 2^256 - 1 - (c + 1), c + 1 = 2^256 - n + 1)
def inva^(n - 2): the inverse of a nonzero a, 0 for 0
def is_zero
def eq_b
def eq
def lt_na < n, for 16 limbs below 2^16
def cm12^256 - n - 1
def is_higha > n / 2 (n is odd), i.e.
def select

def cat
def tag_prefix"BIP0340/aux", "BIP0340/nonce", "BIP0340/challenge" in ASCII
def tag_aux
def tag_nonce
def tag_challenge
def tagged_hhash_tag(x) = SHA256(SHA256(tag) || SHA256(tag) || x)
def tagged
def xor_bytes
def is_odd
def verify_aff
def verify_rR = [s] G - [e] P must be finite, with even y and x(R) = r
def verify_ok
def verify_p
def lift_if
def lift_xlift_x: the point with x-coordinate x and even y, if any
def verify_len
def verifyBIP-340 Verify(pk, m, sig) for a 32-byte x-only key and a 64-byte signature
def secret_ifthe secret key d', when 1 <= d' < n
def secret
def pubkey_aff
def pubkey_d
def pubkeyPubKey(sk) = bytes(d' G), the 32-byte x-only public key
def sign_oksig = bytes(R) || bytes((k + e d) mod n), then Verify(bytes(P), m, sig)
def sign_fin
def sign_k
def sign_nz
def sign_p
def sign_d
def sign_len
def signBIP-340 Sign(sk, m, a) for a 32-byte secret key and 32 bytes of auxiliary randomness; None for an invalid key (or, with negligible probability, a zero nonce or a failed self-check)