I saw that someone had calculated an upper bound for the number of twin primes less than a given integer N.

It is obvious that if we can calculate a lower bound for the number of twin primes less than a given integer N, and that lower bound goes to infinity as N goes to infinity, then we have proven that there are infinitely many twin primes.

What research has been done in this direction?

Kermit Rose