law nvt

lawful-fields@0.1.1.0 · proof_num.bend:644

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

644law nvt:
645  for +len: U32
646  for +t: P.Tree<U32>
647  for +d: Nat
648  for +from: U32
649  for +to: U32
650  for +M: Nat
651  for +q: Nat
652  for +hm: {Nat.pow(2n, 32n) == M : Nat}
653  for +hcq: {U32.to_nat(429496729) == q : Nat}
654  for +hq: {Nat.add(Nat.mul(q, 10n), 6n) == M : Nat}
655  for +h: {D.ok(K.BT(len, t), d) == True{} : Bool}
656  for +hft: {U32.is_le(from, to) == True{} : Bool}
657  for +ht: {Nat.is_le(U32.to_nat(to), D.size(K.BT(len, t))) == True{} : Bool}
658  {F.nat_of(Pair.snd(D.Bytes, Maybe<&2, U32>, C.num(K.BT(len, t), from, to))) == F.decb(D.slice(D.view(K.BT(len, t)), U32.to_nat(from), Nat.sub(U32.to_nat(to), U32.to_nat(from))), M) : Maybe<&2, Nat>}