Which is the most efficient primality test?

Which primality test stands out as the most efficient among the various methods available? Considering the computational requirements, accuracy, and applicability to large numbers, which one would you recommend for determining if a given number is prime with the least amount of resources? Is there a particular algorithm or approach that consistently outperforms others in terms of efficiency?