it-net | Iterative Transformer Network for 3D Point Cloud | Machine Learning library

Your heredocs (e.g. scutil >/dev/null 2>&1 <<-EOF) are unterminated. When you use <<- you can only indent the terminator with tabs.

From man bash (version 5.0.18)

This type of redirection instructs the shell to read input from the current source until a line containing only delimiter (with no trailing blanks) is seen.

...

If the redirection operator is <<-, then all leading tab characters are stripped from input lines and the line containing delimiter.

Combine those together, and << requires the terminator to be completely unprefixed, while <<- allows tabs to prefix the terminator.

One of the problems of async void methods is that they're difficult to test. For your problem, most developers do one of these:

1. Define and use an IAsyncCommand interface.
2. Make their logic async Task and public.
3. Use a framework that supports async commands, e.g., MvvmCross.

See my MSDN magazine article on the subject for details.

Here's an example with the second approach:

This was a bug. JetBrains fixed it in ReSharper 2018.2 EAP 5. It's still finicky, but when it works, it works.

Everything reported is normal, and non-alarming.

It is perfectly OK for the public exponent e to be short and non-random. e = 2¹⁶+1 = 65537 = 0x010001 is common and safe. Some authorities mandate it (or some range including it). Using it (or/and something significantly larger than the bit size of the public modulus) gives some protection against some of the worst RSA paddings.

No, the 17 extra bytes in the public key are unlikely to be an information leak; they more likely are a header part of the data format chosen for an RSA public key by the software you use. My guess is that you are encountering the MS-specific format detailed in this answer (perhaps, within endianness), which also uses precisely 276 bytes for an RSA public key with a 2048-bit public modulus. In that case, you should find that the extra bytes are always the same (thus they demonstrably leak nothing). And there are countless more subtle ways to leak information about the private key, like in the public modulus itself.

Many RSA key generators used in practice, including I guess RSACryptoServiceProvider, first choose e, then somewhat avoid generating primes p such that gcd(e, p-1) ≠ 1. Since e = 65537 is prime, it is enough that ( p % e ) ≠ 1, and this is easily checked, or otherwise insured by the process generating p.

You can set an environmental variable programmatically.