- github.com/prometheus/common: [v0.4.1 → v0.10.0](https://github.com/prometheus/common/compare/v0.4.1...v0.10.0)
- github.com/prometheus/procfs: [v0.0.2 → v0.1.3](https://github.com/prometheus/procfs/compare/v0.0.2...v0.1.3)
- github.com/rubiojr/go-vhd: [0bfd3b3 → 02e2102](https://github.com/rubiojr/go-vhd/compare/0bfd3b3...02e2102)

### `tf.data`:

*   Adds new `tf.data.experimental.service.register_dataset` and
    `tf.data.experimental.service.from_dataset_id` APIs to enable one process to
    register a dataset with the tf.data service, and another process to consume
    data from the dataset.
*   Adds support for dispatcher fault tolerance. To enable fault tolerance,
    configure a `work_dir` when running your dispatcher server and set

INFO:     Will watch for changes in these directories: ['/home/user/code/awesomeapp']
INFO:     Uvicorn running on http://127.0.0.1:8000 (Press CTRL+C to quit)
INFO:     Started reloader process [2248755] using WatchFiles
INFO:     Started server process [2248757]
INFO:     Waiting for application startup.
INFO:     Application startup complete.
```

### Refactors

return false } iterations-- if iterations == 0 { return true } } } // primes are the first prime numbers (except 2), such that the product of any // three primes fits in a uint32. // // More primes cause fewer Miller-Rabin tests of composites (nothing can help // with the final test on the actual prime) but have diminishing returns: these // 255 primes catch 84.9% of composites, the next 255 would catch 1.5% more. // Adding primes can still be marginally useful since they only compete with the // (much...

millerRabinSetup(w) if err != nil { // w is zero, one, or even. return false } primes, err := bigmod.NewNat().SetBytes(productOfPrimes, mr.w) // If w is too small for productOfPrimes, key generation is // going to be fast enough anyway. if err == nil { _, hasInverse := primes.InverseVarTime(primes, mr.w) if !hasInverse { // productOfPrimes doesn't have an inverse mod w, // so w is divisible by at least one of the primes. return false } } // iterations is the number of Miller-Rabin rounds, each with...