:= 1; i < len(table); i++ { table[i].montgomeryMul(table[i-1], table[0], m) } out.resetFor(m) out.limbs[0] = 1 out.montgomeryRepresenta(m) tmp := NewNat().ExpandFor(m) for _, b := range e { for _, j := range []int{4, 0} { // Square four times. Optimization note: this can be implemented // more efficiently than with generic Montgomery multiplication. out.montgomeryMul(out, out, m) out.montgomeryMul(out, out, m) out.montgomeryMul(out, out, m) out.montgomeryMul(out, out, m) // Select x^k in constant...

- NONE ([#97167](https://github.com/kubernetes/kubernetes/pull/97167), [@geegeea](https://github.com/geegeea)) [SIG Node]
- NetworkPolicy validation framework optimizations for rapidly verifying CNI's work correctly across several pods and namespaces ([#91592](https://github.com/kubernetes/kubernetes/pull/91592), [@jayunit100](https://github.com/jayunit100)) [SIG Network, Storage and Testing]