Goldbach's Conjecture

I read about this conjecture recently, and it
fascinated me. It goes something like this:

Every even number greater than 2 can be 
represented as a sum of 2 prime numbers. 
It can be the same prime number. 

ex. : 18 = 9 + 9

Now, the prime numbers are absolutely
scattered, with no recognisable pattern. The
fact that any even number can be represented
by simply picking the correct pair of primes is
completely mind-blowing.

This Conjecture has actually been tested for
numbers up to 4* 10^18, which might seem like
a pretty good argument, but unless it can be
proven to be mathematically to be true for all
numbers, no number of even numbers which
obey Goldbach's Conjecture can prove it
without doubt, as there will always be another
even number, and an infinite number of cases
cannot be checked by a computer.

Goldbach's Conjecture might seem unimportant,
but it carries some serious implications. As this
theory is very deeply linked with prime numbers,
proving it could answer an ancient question:

"Do the primes have a pattern?"

If this turns out to be true, it could enable the solver
to access any bit of remotely transferred data, as
most of today's online messages are encoded by
several algorithms, like RSA, which depend heavily
on prime numbers.