* StatefulSet will now fill the `hostname` and `subdomain` fields if they're empty on existing Pods it owns. This allows...

- When scaling a Deployment during a rollout, the ReplicaSets of all Deployments are now scaled proportionally based on the number of replicas they each have instead of only scaling the newest ReplicaSet.

### kubectl rolling-update: < v1.4.0 client vs >=v1.4.0 cluster

  - [beta] Deployments that cannot make progress in rolling out the newest version will now indicate via the API they are blocked ([docs](http://kubernetes.io/docs/user-guide/deployments/#failed-deployment)) ([kubernetes/features#122](https://github.com/kubernetes/enhancements/issues/122))

* Use arm32v7|arm64v8 images instead of the deprecated armhf|aarch64 image organizations ([#50602](https://github.com/kubernetes/kubernetes/pull/50602), [@dixudx](https://github.com/dixudx))
* audit newest impersonated user info in the ResponseStarted, ResponseComplete audit stage ([#48184](https://github.com/kubernetes/kubernetes/pull/48184), [@CaoShuFeng](https://github.com/CaoShuFeng))

- If more than one StorageClass is designated as default (via the "storageclass.kubernetes.io/is-default-class" annotation), choose the newest one instead of throwing an error. ([#110559](https://github.com/kubernetes/kubernetes/pull/110559), [@danishprakash](https://github.com/danishprakash))

### SIG UI

The migration to the newest version of Angular is still under active development as it is most important thing on the roadmap at the moment. We are getting closer to the new release. We continue fixing bugs and adding other improvements.

### SIG VMWare

# v1.7.7

* Use arm32v7|arm64v8 images instead of the deprecated armhf|aarch64 image organizations ([#50602](https://github.com/kubernetes/kubernetes/pull/50602), [@dixudx](https://github.com/dixudx))
* audit newest impersonated user info in the ResponseStarted, ResponseComplete audit stage ([#48184](https://github.com/kubernetes/kubernetes/pull/48184), [@CaoShuFeng](https://github.com/CaoShuFeng))

q.Nat().SubOne(q) // lcm(a, b) = a×b / gcd(a, b) = a × (b / gcd(a, b)) // Our GCD requires at least one of the numbers to be odd. For LCM we only // need to preserve the larger prime power of each prime factor, so we can // right-shift the number with the fewest trailing zeros until it's odd. // For odd a, b and m >= n, lcm(a×2ᵐ, b×2ⁿ) = lcm(a×2ᵐ, b). az, bz := a.TrailingZeroBitsVarT(), b.TrailingZeroBitsVarT() if az < bz { a = a.ShiftRightVarTime(az) } else { b = b.ShiftRightVarTime(bz) } gcd, err := bi...

q.Nat().SubOne(q) // lcm(a, b) = a×b / gcd(a, b) = a × (b / gcd(a, b)) // Our GCD requires at least one of the numbers to be odd. For LCM we only // need to preserve the larger prime power of each prime factor, so we can // right-shift the number with the fewest trailing zeros until it's odd. // For odd a, b and m >= n, lcm(a×2ᵐ, b×2ⁿ) = lcm(a×2ᵐ, b). az, bz := a.TrailingZeroBitsVarT(), b.TrailingZeroBitsVarT() if az < bz { a = a.ShiftRightVarTime(az) } else { b = b.ShiftRightVarTime(bz) } gcd, err := bi...