divide 8 are more complex to implement, but // are likely to be more efficient if necessary. table := [(1 << 4) - 1]*Nat{ // table[i] = x ^ (i+1) // newNat calls are unrolled so they are allocated on the stack. NewNat(), NewNat(), NewNat(), NewNat(), NewNat(), NewNat(), NewNat(), NewNat(), NewNat(), NewNat(), NewNat(), NewNat(), NewNat(), NewNat(), NewNat(), } table[0].set(x).montgomeryRepresenta(m) for i := 1; i < len(table); i++ { table[i].montgomeryMul(table[i-1], table[0], m) } out.resetFor(m) out.limbs[0]...