def pow_step

bend-collections-laws-crypto@1.0.0.0 · src/crypto/secp256k1/field.bend:78

import Base

78# x^e for the exponent e given by its bits, most significant first
79def pow_step(b: Nat, +x: List<&2, Nat>, +s: List<&2, Nat>) -> List<&2, Nat>:
80  match b:
81    case 0n: s
82    case 1n+k: mul(s, x)