List Sophie Germain primes The Question
A Sophie Germain prime is a prime \$p\$ such that \$2p+1\$ is prime as well. For example, 11 is a Sophie Germain prime because 23 is prime as well. Write the shortest program to calculate Sophie Germain primes in ascending order
Rules

The Sophie Germain primes must be generated by your program, not from an external source.
Your program must calculate all Sophie Germain primes under \$2^{32}-1\$
You must print each distinct Sophie Germain prime your program finds.
The person with the lowest score wins

Scoring

2 points per byte of your code
-10 if you can show a prime generated by your program greater than \$2^{32}-1\$
Pyth, 19 bytes * 2 - 10 = 28

Note that the online compiler/executor doesn't show output because it's an infinite loop.

K1#~K1I&amp;!tPK!tPhyKK


Explained:

K1                      K=1
  #                     While true:
   ~K1                  K+=1
      I                 If
       &amp;                logical AND
        !tPK            K is prime
            !tPhyK      2*K+1 is prime (y is double, h is +1)
                  K     Print K