News for hackers. Stuff that matters.
Re:48th Mersenne prime found by littledot5566 on Tuesday February 05, 2013 @12:16PM (#5171802)
When dealing with numbers of such magnitude, how are they stored in memory?
Re:48th Mersenne prime found by iand on Tuesday February 05, 2013 @12:37PM (#5171948)
Even naively 2^257885161-1 can be represented with 257885161 bits, or 30MB.
Re:48th Mersenne prime found by kedean on Tuesday February 05, 2013 @01:48PM (#5172414)
I'm not sure how GIMPS does it, but if you're interested in how it CAN be done you could look into the GMP library for C.
Re:48th Mersenne prime found by Dubslow on Wednesday February 06, 2013 @12:33AM (#5175035)
It's definitely just a standard lots-of-bits. Every bit of information is needed, lose one and the whole test will be wrong. For current wavefront exponents, like 2^60,000,000-1, save files are around 8 MB, or ~60M bits -- exactly what you'd expect.

Also Prime95 doesn't use GMP, its code is all hand-coded assembly, optimized specifically for the LL test and x86 architecture, written by one very dedicated George Woltman.