BEGIN:VCALENDAR
VERSION:2.0
PRODID:IEEE vTools.Events//EN
CALSCALE:GREGORIAN
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
DTSTART:20260308T030000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
RRULE:FREQ=YEARLY;BYDAY=2SU;BYMONTH=3
TZNAME:EDT
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20251102T010000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
RRULE:FREQ=YEARLY;BYDAY=1SU;BYMONTH=11
TZNAME:EST
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260119T000128Z
UID:6C75AF1C-F32F-40E3-A5D3-4511300F3A75
DTSTART;TZID=America/New_York:20260115T200000
DTEND;TZID=America/New_York:20260115T213000
DESCRIPTION:The quest to discover a new largest known prime requires the de
 velopment of advanced computational techniques and the development of faul
 t resilient software. It's not just for big primes: we can also apply thes
 e approaches to complex and resilient computations in seismic analysis\, l
 arge scale fluid dynamics\, cryptography\, and deep space probe design.\n\
 nThe search for large primes has been going on for centuries. In 1952\, pr
 imality testing entered the realm of digital computers. We have come a lon
 g way since the 1970s when Landon Noll discovered a 6533-digit prime (www.
 isthe.com/chongo/tech/math/prime/m21701.html). Today's largest known prime
  (www.isthe.com/chongo/tech/math/prime/mersenne.html#largest) is over 25 m
 illion digits long!\n\nThe calculations required to test extremely large n
 umbers for primality are tricky. They must be designed to overcome compile
 r and assembler errors and CPU calculation errors. The reason for such ext
 reme measures is that the length of the primality search often exceeds the
  mean time to error of the calculating system. A slow and correct answer i
 s infinitely preferable to a fast but incorrect answer. The world record g
 oes neither to the fastest coder nor to the person with the fastest hardwa
 re but rather to the first result that is proven to be correct.\n\nIn the 
 talk\, Landon will explain how the test for primality is performed\, and h
 e will outline an optimal search strategy for finding a new largest known 
 prime. NOTE: Knowledge of advanced mathematics is NOT required for this ta
 lk.\n\nDuring this talk\, a subset of these slides will be presented: http
 ://www.isthe.com/chongo/tech/math/prime/prime-tutorial.pdf\n\nSpeaker(s): 
 Landon Noll\, \n\nRoom: 004\, Bldg: Friend Center\, 79 William St\, Prince
 ton\, New Jersey\, United States\, 08544\, Virtual: https://events.vtools.
 ieee.org/m/532171
LOCATION:Room: 004\, Bldg: Friend Center\, 79 William St\, Princeton\, New 
 Jersey\, United States\, 08544\, Virtual: https://events.vtools.ieee.org/m
 /532171
ORGANIZER:dmancl@acm.org
SEQUENCE:15
SUMMARY:The Quest for the Largest Known Prime Number
URL;VALUE=URI:https://events.vtools.ieee.org/m/532171
X-ALT-DESC:Description: <br /><p>The quest to discover a new largest known 
 prime requires the development of advanced computational techniques and th
 e development of fault resilient software. It's not just for big primes: w
 e can also apply these approaches to complex and resilient computations in
  seismic analysis\, large scale fluid dynamics\, cryptography\, and deep s
 pace probe design.</p>\n<p>The search for large primes has been going on f
 or centuries. In 1952\, primality testing entered the realm of digital com
 puters. We have come a long way since the 1970s when Landon Noll discovere
 d a 6533-digit prime (www.isthe.com/chongo/tech/math/prime/m21701.html). T
 oday's largest known prime (www.isthe.com/chongo/tech/math/prime/mersenne.
 html#largest) is over 25 million digits long!</p>\n<p>The calculations req
 uired to test extremely large numbers for primality are tricky. They must 
 be designed to overcome compiler and assembler errors and CPU calculation 
 errors. The reason for such extreme measures is that the length of the pri
 mality search often exceeds the mean time to error of the calculating syst
 em. A slow and correct answer is infinitely preferable to a fast but incor
 rect answer. The world record goes neither to the fastest coder nor to the
  person with the fastest hardware but rather to the first result that is p
 roven to be correct.</p>\n<p>In the talk\, Landon will explain how the tes
 t for primality is performed\, and he will outline an optimal search strat
 egy for finding a new largest known prime. NOTE: Knowledge of advanced mat
 hematics is NOT required for this talk.</p>\n<p>During this talk\, a subse
 t of these slides will be presented: http://www.isthe.com/chongo/tech/math
 /prime/prime-tutorial.pdf</p>
END:VEVENT
END:VCALENDAR