ghe

import matplotlib.pyplot as plt

import numpy
def primesfrom2to(n):
    """ Input n>=6, Returns a array of primes, 2 <= p < n """
    sieve = numpy.ones(n//3 + (n%6==2), dtype=numpy.bool)
    for i in range(1,int(n**0.5)//3+1):
        if sieve[i]:
            k=3*i+1|1
            sieve[       k*k//3     ::2*k] = False

ghe

Keybase proof

I hereby claim:

• I am ghe on github.
• I am gens (https://keybase.io/gens) on keybase.
• I have a public key whose fingerprint is 56D3 2036 D7B2 9434 8744 CCCE E4C4 C989 F15B 3F9F

To claim this, I am signing this object:

ghe

#!/bin/bash
KEYFILE=$1
CMDS=${@:2}
if [ -e ${KEYFILE} ]; then
  chmod 600 ${KEYFILE}

  TMP_GIT_SSH=$(mktemp /tmp/git_ssh.XXXXXXXXXX)
  echo "#!/bin/sh" > ${TMP_GIT_SSH}
  echo "exec /usr/bin/ssh -o StrictHostKeyChecking=no -i ${KEYFILE}" '"$@"' >> ${TMP_GIT_SSH}
  chmod +x ${TMP_GIT_SSH}

ghe

Keybase proof

I hereby claim:

• I am ghe on github.
• I am gens (https://keybase.io/gens) on keybase.
• I have a public key whose fingerprint is 9CC7 B320 F161 0CBD 209F 8881 96BF 6E53 87CE C70A

To claim this, I am signing this object: