From Wikipedia, the free encyclopedia
Content deleted Content added
|
|
|||
| Line 12: | Line 12: | ||
|
”’George Woltman”’ (born November 10, 1957) is the founder of the [[Great Internet Mersenne Prime Search]] (GIMPS), a [[distributed computing]] project researching [[Mersenne prime]] numbers using his software [[Prime95]]. He graduated from the [[Massachusetts Institute of Technology]] (MIT) with a BS and a MS in computer science. He lives in [[North Carolina]].<ref name=”t5k”>{{cite web |title=PrimePage Bios: George F. Woltman |url=https://t5k.org/bios/page.php?lastname=Woltman |website=t5k.org}}</ref> |
”’George Woltman”’ (born November 10, 1957) is the founder of the [[Great Internet Mersenne Prime Search]] (GIMPS), a [[distributed computing]] project researching [[Mersenne prime]] numbers using his software [[Prime95]]. He graduated from the [[Massachusetts Institute of Technology]] (MIT) with a BS and a MS in computer science. He lives in [[North Carolina]].<ref name=”t5k”>{{cite web |title=PrimePage Bios: George F. Woltman |url=https://t5k.org/bios/page.php?lastname=Woltman |website=t5k.org}}</ref> |
||
|
His mathematical libraries (”gwnum”) created for the GIMPS project are the fastest known for [[arbitrary-precision arithmetic|multiplication of large integers]] on [[x86]] and [[x86-64]] CPUs. They are used by other [[distributed computing]] projects as well, such as [[Seventeen or Bust]]<ref>{{cite web|url=http://www.seventeenorbust.com/|title=Seventeen or Bust Distributed Computing|url-status=dead|archive-url=https://web.archive.org/web/20160405211049/http://seventeenorbust.com/|archive-date=April 5, 2016|date=2002–2016|first1=Louie|last1=Helm|first2=David|last2=Norris}}</ref> and [[PrimeGrid]] (PRST).<ref>{{cite web |title=PrimePage Bios: Pavel Atnashev’s PRST |url=https://t5k.org/bios/page.php?id=5652 |website=t5k.org |quote=PRST is a primality testing utility written in C++ by Pavel Atnashev. It is based on GWnum multiplication library by George Woltman.}}</ref> GMP-ECM, a sophisticated software package for [[Lenstra elliptic-curve factorization]], can also use ”gwnum” for a more than |
His mathematical libraries (”gwnum”) created for the GIMPS project are the fastest known for [[arbitrary-precision arithmetic|multiplication of large integers]] on [[x86]] and [[x86-64]] CPUs. They are used by other [[distributed computing]] projects as well, such as [[Seventeen or Bust]]<ref>{{cite web|url=http://www.seventeenorbust.com/|title=Seventeen or Bust Distributed Computing|url-status=dead|archive-url=https://web.archive.org/web/20160405211049/http://seventeenorbust.com/|archive-date=April 5, 2016|date=2002–2016|first1=Louie|last1=Helm|first2=David|last2=Norris}}</ref> and [[PrimeGrid]] (PRST).<ref>{{cite web |title=PrimePage Bios: Pavel Atnashev’s PRST |url=https://t5k.org/bios/page.php?id=5652 |website=t5k.org |quote=PRST is a primality testing utility written in C++ by Pavel Atnashev. It is based on GWnum multiplication library by George Woltman.}}</ref> GMP-ECM, a sophisticated software package for [[Lenstra elliptic-curve factorization]], can also use ”gwnum” for a more than speedup in stage 1.<ref>{{cite web |title=INSTALL-gwnum |url=https://gitlab.inria.fr/zimmerma/ecm/-/blob/git-7.0.6/INSTALL-gwnum?ref_type=tags |website=gitlab.inria.fr|last=McLaughlin |first=Paul}}</ref> |
||
|
He also worked on a [[Transistor–transistor logic|TTL]] version of [[Maze War]] while a student at MIT.{{citation needed|date=November 2025}} Later he worked as a programmer for [[Data General]].<ref name=”t5k”/> |
He also worked on a [[Transistor–transistor logic|TTL]] version of [[Maze War]] while a student at MIT.{{citation needed|date=November 2025}} Later he worked as a programmer for [[Data General]].<ref name=”t5k”/> |
||
Latest revision as of 01:34, 26 November 2025
American mathematician
George Woltman (born November 10, 1957) is the founder of the Great Internet Mersenne Prime Search (GIMPS), a distributed computing project researching Mersenne prime numbers using his software Prime95. He graduated from the Massachusetts Institute of Technology (MIT) with a BS and a MS in computer science. He lives in North Carolina.[1]
His mathematical libraries (gwnum) created for the GIMPS project are the fastest known for multiplication of large integers on x86 and x86-64 CPUs. They are used by other distributed computing projects as well, such as Seventeen or Bust[2] and PrimeGrid (PRST).[3] GMP-ECM, a sophisticated software package for Lenstra elliptic-curve factorization, can also use gwnum for a more than 8× speedup in stage 1.[4]
He also worked on a TTL version of Maze War while a student at MIT.[citation needed] Later he worked as a programmer for Data General.[1]
