can defer the check to the end of key // generation and return an error if it fails. See [checkPrivateKey]. return newPrivateKey(N, 65537, d, P, Q) } } // errDivisorTooLarge is returned by [totient] when gcd(p-1, q-1) is too large. var errDivisorTooLarge = errors.New("divisor too large") // totient computes the Carmichael totient function λ(N) = lcm(p-1, q-1). func totient(p, q *bigmod.Modulus) (*bigmod.Modulus, error) { a, b := p.Nat().SubOne(p), q.Nat().SubOne(q) // lcm(a, b) = a×b / gcd(a, b) =...

*   Fixes a memory leak when a graph node is invalid
    ([CVE-2022-23578](https://cve.mitre.org/cgi-bin/cvename.cgi?name=CVE-2022-23578))
*   Fixes an abort caused by allocating a vector that is too large
    ([CVE-2022-23580](https://cve.mitre.org/cgi-bin/cvename.cgi?name=CVE-2022-23580))
*   Fixes multiple `CHECK`-failures during Grappler's `IsSimplifiableReshape`

pkg reflect, method (Value) Grow(int) #48000
pkg reflect, method (Value) SetZero() #52376
pkg regexp/syntax, const ErrLarge ErrorCode #56041
pkg regexp/syntax, const ErrLarge = "expression too large" #56041
pkg runtime/cgo (darwin-amd64-cgo), type Incomplete struct #46731
pkg runtime/cgo (darwin-arm64-cgo), type Incomplete struct #46731
pkg runtime/cgo (freebsd-386-cgo), type Incomplete struct #46731