def gfm.mul.raw

bend-osdev-gf@0.1.1.0 · gfm.bend:69

import Base

69# the product of a and b, both below 2^m (matching both first, so that the
70# product of unknown values stays a small term for the proof checkers)
71def gfm.mul.raw(f: GfmField, a: U32, b: U32) -> U32:
72  match f a b:
73    case GfmField{+m, +poly} U32{wa} U32{wb}:
74      gfm.mul.go(m, m, poly, U32{wa}, U32{wb}, 0)