def levels_go

bend-collections-laws-crypto@1.0.0.0 · src/crypto/argon2/memory.bend:48

import Base

48# The smallest k >= k0 with 2^k >= n.
49def levels_go(fuel: Nat, +n: Nat, +k: Nat, done: Bool) -> Nat:
50  match fuel done:
51    case _ True{}:
52      k
53    case 0n False{}:
54      k
55    case 1n+f False{}:
56      levels_go(f, n, 1n+k, Nat.is_le(n, pw(1n+k)))