def uq.pw
import bend-osdev-algo@0.1.0.0/proof_u32.bend as ProofU32import Base
9# 2^n
10def uq.pw(n: Nat) -> Nat:
11 match n:
12 case 0n:
13 1n
14 case 1n+p:
15 Nat.double(uq.pw(p))
import bend-osdev-algo@0.1.0.0/proof_u32.bend as ProofU32import Base
9# 2^n
10def uq.pw(n: Nat) -> Nat:
11 match n:
12 case 0n:
13 1n
14 case 1n+p:
15 Nat.double(uq.pw(p))