law ulen

lawful-bytes@0.1.1.0 · proof_ops.bend:17

import Base
import lawful-bytes@0.1.1.0/defs.bend as D
import lawful-bytes@0.1.1.0/proof_core.bend as C
import lawful-arrays@0.1.0.0/defs.bend as A
import lawful-arrays@0.1.0.0/proof_tree.bend as P

17# The bytes in use fit in the block.
18law ulen:
19  for +t: P.Tree<U32>
20  for +d: Nat
21  for +hf: {A.full(U32, P.fromT(U32, t), d) == True{} : Bool}
22  {List.length(&2, U32, D.unpack(C.WL(t))) == Nat.mul(4n, Nat.pow(2n, d)) : Nat}