- Sort Score
- Num 10 results
- Language All
Results 221 - 224 of 224 for especiales (0.07 seconds)
-
CHANGELOG/CHANGELOG-1.21.md
### Bug or Regression - An inefficient lock in EndpointSlice controller metrics cache has been reworked. Network programming latency may be significantly reduced in certain scenarios, especially in clusters with a large number of Services. ([#107169](https://github.com/kubernetes/kubernetes/pull/107169), [@robscott](https://github.com/robscott)) [SIG Apps and Network]
Created: Fri Dec 26 09:05:12 GMT 2025 - Last Modified: Fri Oct 14 07:03:14 GMT 2022 - 367.3K bytes - Click Count (0) -
CHANGELOG/CHANGELOG-1.23.md
### Bug or Regression - An inefficient lock in EndpointSlice controller metrics cache has been reworked. Network programming latency may be significantly reduced in certain scenarios, especially in clusters with a large number of Services. ([#107167](https://github.com/kubernetes/kubernetes/pull/107167), [@robscott](https://github.com/robscott)) [SIG Apps and Network]
Created: Fri Dec 26 09:05:12 GMT 2025 - Last Modified: Tue Feb 28 21:06:52 GMT 2023 - 424.5K bytes - Click Count (0) -
CHANGELOG/CHANGELOG-1.20.md
that they mount the volumes for. This improves the security posture in the mounting process where the volumes are ACL’ed on the pods’ service account without handing out unnecessary permissions to the CSI drivers’ service account. This feature is especially important for secret-handling CSI drivers, such as the secrets-store-csi-driver. Since these tokens can be rotated and short-lived, this feature also provides a knob for CSI drivers to receive `NodePublishVolume` RPC calls periodically with the...
Created: Fri Dec 26 09:05:12 GMT 2025 - Last Modified: Wed Jan 19 21:05:45 GMT 2022 - 409K bytes - Click Count (0) -
lib/fips140/v1.1.0-rc1.zip
skDecode to // > return values that are not in the correct range. Hence, skDecode // > should only be run on inputs that come from trusted sources. // // so it sounds like it doesn't even want us to check the coefficients are // within bounds, but especially if using this format for key exchange, that // sounds like a bad idea. So we check everything. t1 := make([][n]uint16, k, maxK) for i := range k { tHat := priv.s2[i] for j := range l { tHat = polyAdd(tHat, nttMul(A[i*l+j], priv.s1[j])) } t := inverseNTT(tHat)...
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Thu Dec 11 16:27:41 GMT 2025 - 663K bytes - Click Count (0)