resources of running and terminating pods when deciding to accept new pods, since terminating pods are still holding on to those resources. This stricter handling may surface to end users as pod rejections when creating pods that are scheduled to mostly full nodes that have other terminating pods holding the resources the new pods need. The most likely error would be a pod set to `Failed` phase with reason set to `OutOfCpu` or `OutOfMemory`, but any resource on the node that has some fixed limit...

quick.Check(func(a *Nat) bool { one := &Nat{make([]uint, len(a.limbs))} one.limbs[0] = 1 aPlusOne := new(big.Int).SetBytes(natBytes(a)) aPlusOne.Add(aPlusOne, big.NewInt(1)) m, _ := NewModulus(aPlusOne.Bytes()) monty := new(Nat).set(a) monty.montgomeryRepresenta(m) aAgain := new(Nat).set(monty) aAgain.montgomeryMul(monty, one, m) if a.Equal(aAgain) != 1 { t.Errorf("%v != %v", a, aAgain) return false } return true }, &quick.Config{}) if err != nil { t.Error(err) } } func TestShiftIn(t *testing.T) { if bits.UintSize...

quick.Check(func(a *Nat) bool { one := &Nat{make([]uint, len(a.limbs))} one.limbs[0] = 1 aPlusOne := new(big.Int).SetBytes(natBytes(a)) aPlusOne.Add(aPlusOne, big.NewInt(1)) m, _ := NewModulus(aPlusOne.Bytes()) monty := new(Nat).set(a) monty.montgomeryRepresenta(m) aAgain := new(Nat).set(monty) aAgain.montgomeryMul(monty, one, m) if a.Equal(aAgain) != 1 { t.Errorf("%v != %v", a, aAgain) return false } return true }, &quick.Config{}) if err != nil { t.Error(err) } } func TestShiftIn(t *testing.T) { if bits.UintSize...