This question already has an answer here:
What's the biggest $n$ such that for all $1<x<n$, we know for sure if $x$ is prime?
The smallest primes are easy to find, and the biggest ones we haven't found yet. At the top, we have Mersenne primes, but not all primes are Mersenne primes. There's an unclear boundry, up to which we know some of the primes, but probably not all.