pkg syscall (darwin-arm64), const ENODATA Errno
pkg syscall (darwin-arm64), const ENODEV = 19
pkg syscall (darwin-arm64), const ENOEXEC = 8
pkg syscall (darwin-arm64), const ENOLCK = 77
pkg syscall (darwin-arm64), const ENOLINK = 97
pkg syscall (darwin-arm64), const ENOLINK Errno
pkg syscall (darwin-arm64), const ENOMEM = 12
pkg syscall (darwin-arm64), const ENOMSG = 91

pkg syscall (netbsd-arm64-cgo), const ENODATA Errno
pkg syscall (netbsd-arm64-cgo), const ENODEV = 19
pkg syscall (netbsd-arm64-cgo), const ENOEXEC = 8
pkg syscall (netbsd-arm64-cgo), const ENOLCK = 77
pkg syscall (netbsd-arm64-cgo), const ENOLINK = 95
pkg syscall (netbsd-arm64-cgo), const ENOLINK Errno
pkg syscall (netbsd-arm64-cgo), const ENOMEM = 12
pkg syscall (netbsd-arm64-cgo), const ENOMSG = 83

- github.com/kr/pretty: [v0.2.1 → v0.3.0](https://github.com/kr/pretty/compare/v0.2.1...v0.3.0)
- github.com/mailru/easyjson: [v0.7.6 → v0.7.7](https://github.com/mailru/easyjson/compare/v0.7.6...v0.7.7)
- github.com/moby/ipvs: [v1.0.1 → v1.1.0](https://github.com/moby/ipvs/compare/v1.0.1...v1.1.0)
- github.com/moby/term: [39b0c02 → 1aeaba8](https://github.com/moby/term/compare/39b0c02...1aeaba8)

involved in Montgomery // multiplication. func minusInverseModW(x uint) uint { // Every iteration of this loop doubles the least-significant bits of // correct inverse in y. The first three bits are already correct (1⁻¹ = 1, // 3⁻¹ = 3, 5⁻¹ = 5, and 7⁻¹ = 7 mod 8), so doubling five times is enough // for 64 bits (and wastes only one iteration for 32 bits). // // See https://crypto.stackexchange.com/a/47496. y := x for i := 0; i < 5; i++ { y = y * (2 - x*y) } return -y } // NewModulus creates a new Modulus...

involved in Montgomery // multiplication. func minusInverseModW(x uint) uint { // Every iteration of this loop doubles the least-significant bits of // correct inverse in y. The first three bits are already correct (1⁻¹ = 1, // 3⁻¹ = 3, 5⁻¹ = 5, and 7⁻¹ = 7 mod 8), so doubling five times is enough // for 64 bits (and wastes only one iteration for 32 bits). // // See https://crypto.stackexchange.com/a/47496. y := x for i := 0; i < 5; i++ { y = y * (2 - x*y) } return -y } // NewModulus creates a new Modulus...