arbitrary.
    *   Added `tf.train.Checkpoint` for reading/writing object-based
        checkpoints.
    *   Added LinearOperatorKronecker, a dense-free implementation of the
        Kronecker Product.
    *   Allow LinearOperator to broadcast.
    *   SavedModelBuilder will now deduplicate asset names that point to files
        with the same basename and the same contents. Note that this may result

millerRabinIteration(mr, b) if err != nil { // b was rejected. continue } if result == millerRabinCOMPOSITE { return false } iterations-- if iterations == 0 { return true } } } // productOfPrimes is the product of the first 74 primes higher than 2. // // The number of primes was selected to be the highest such that the product fit // in 512 bits, so to be usable for 1024 bit RSA keys. // // Higher values cause fewer Miller-Rabin tests of composites (nothing can help // with the final test on the actual prime) but...

1 (T = a × b) is computed as a large pen-and-paper column // multiplication of two numbers with n base-2^_W digits. If we just // wanted to produce 2n-wide T, we would do // // for i := 0; i < n; i++ { // d := bLimbs[i] // T[n+i] = addMulVVW(T[i:n+i], aLimbs, d) // } // // where d is a digit of the multiplier, T[i:n+i] is the shifted // position of the product of that digit, and T[n+i] is the final carry. // Note that T[i] isn't modified after processing the i-th digit. // // Instead of running two...

    * This was reported internally by [@rushilsrivastava](https://github.com/rushilsrivastava) as a memory leak when the server had unhandled exceptions that would produce internal server errors, the memory allocated before that point would not be released.