Newsgroups: sci.crypt
Path: msuinfo!caen!zaphod.mps.ohio-state.edu!rpi!cecchinr
From: cecchinr@cs.rpi.edu (Ron Cecchini)
Subject: Re: Prime Number list (40-43 digit and 80-83 digit)
Message-ID: <w!0r=2m@rpi.edu>
Nntp-Posting-Host: cs.rpi.edu
Organization: Rensselaer Computer Science, Troy NY
References: <1992Jan26.083119.69248@ns1.cc.lehigh.edu> <1992Jan29.135645.17830@linus.mitre.org> <009r4+m@rpi.edu>
Date: 29 Jan 92 23:05:45 GMT
Lines: 19

In article <009r4+m@rpi.edu> cecchinr@cs.rpi.edu (Ron Cecchini) writes:

[stuff deleted]

>Interesting.  There is a PhD student here at my school whose doctoral
>thesis is on this very subject.  Believe it or not, his system routinely
>proves numbers of up to about 1000 digits prime or not prime (when I say
>"proves" I mean it.  His system actually generates proofs.)
>
>Ron

A minor correction:
I should have said "routinely proves numbers of around 40 digits prime,
etc."  Right now his system has been chugging away for a few weeks on
a 1200 digits number.  The person's name is Tom Valente, 
valentet@cs.rpi.edu (he gave me permission to use his name). 

Ron

