F. Morain has been continuously improving his primality proving algorithm called ECPP, originally developed in the early '90s. Binaries for version 6.4.5 have been available since 2001 on his web page. Proving the primality of a 512 bit number requires less than a second on an average PC. His personal record is about 20, 000 decimal digits, with the fast version he started developing in 2003. All of the code is written in C, and based on the GMP package.