def hash_r

bend-collections-laws-crypto@1.0.0.0 · proofs/crypto/secp256k1/pscal.bend:46

import Base
import bend-collections-laws-crypto@1.0.0.0/spec/crypto/secp256k1/field.bend as FS
import bend-collections-laws-crypto@1.0.0.0/src/crypto/secp256k1/bytes.bend as B
import bend-collections-laws-crypto@1.0.0.0/src/crypto/secp256k1/ecdsa.bend as E
import bend-collections-laws-crypto@1.0.0.0/proofs/crypto/secp256k1/bytes.bend as BY

46def hash_r(+one: Nat, +h1: {one == 1n : Nat}, +h: List<&2, U32>, +hl: {B.has_len(32n, h) == True{} : Bool}) -> {FS.reduced(one, FS.order(one), E.hash_scalar(h)) == True{} : Bool}:
47  sred_r(one, h1, B.of_be(h), BY.of_be_limbs(one, h1, h, hl))