Re: [Caml-list] Miller-Rabin primality test

["Yaron M. Minsky" <yminsky@CS.Cornell.EDU>]

There's an implementation that's part of SKS
(http://sks.sourceforge.net).  It's based on the Numerix library,
although I'm not sure that's necessarily the best way to go.  The key
files are number.ml and prime.ml, which you can get from the CVS
repository:

http://cvs.sourceforge.net/cgi-bin/viewcvs.cgi/sks/sks/

(Or you can look at sks.sourceforge.net to download the distribution.) 

Anyone know what the status of Numerix is these days?  Is it still
faster than the alternatives  (gmp, Nat)?  

y

On Tue, 2003-06-03 at 07:05, Richard Jones wrote:
> To save me writing this over again, does someone have an
> implementation of a probabilistic primality test in Ocaml?
> 
> Assuming I have to write one, is the 'Nat' module the best (ie.  most
> mature) way to represent natural numbers in Ocaml? Or is there some
> other module I ought to be using instead?
> 
> Thanks,
> 
> Rich.
-- 
|--------/            Yaron M. Minsky              \--------|
|--------\ http://www.cs.cornell.edu/home/yminsky/ /--------|

Open PGP --- KeyID B1FFD916 (new key as of Dec 4th)
Fingerprint: 5BF6 83E1 0CE3 1043 95D8 F8D5 9F12 B3A9 B1FF D916



-------------------
To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners