better_prime 0.0.1

data/Rakefile

@@ -0,0 +1,15 @@
+begin
+  require 'jeweler'
+  Jeweler::Tasks.new do |s|
+    s.name = "better_prime"
+    s.summary = "An Uber-fast primality testing library."
+    s.email = "burke@burkelibbey.org"
+    s.homepage = "http://github.com/burke/better_prime"
+    s.description = "An Uber-fast primality testing library."
+    s.authors = ["Burke Libbey", "Ryan Neufeld"]
+    s.files =  FileList["[A-Z]*", "{src,ext,lib}/**/*"]
+    s.extensions = ["ext/extconf.rb"]
+  end
+rescue LoadError
+  puts "Jeweler, or one of its dependencies, is not available. Install it with: sudo gem install technicalpickles-jeweler -s http://gems.github.com"
+end

data/VERSION

@@ -0,0 +1 @@
+0.0.1

data/ext/Makefile

@@ -0,0 +1,157 @@
+
+SHELL = /bin/sh
+
+#### Start of system configuration section. ####
+
+srcdir = .
+topdir = /System/Library/Frameworks/Ruby.framework/Versions/1.8/usr/lib/ruby/1.8/universal-darwin10.0
+hdrdir = $(topdir)
+VPATH = $(srcdir):$(topdir):$(hdrdir)
+exec_prefix = $(prefix)
+prefix = $(DESTDIR)/System/Library/Frameworks/Ruby.framework/Versions/1.8/usr
+sharedstatedir = $(prefix)/com
+mandir = $(DESTDIR)/usr/share/man
+psdir = $(docdir)
+oldincludedir = $(DESTDIR)/usr/include
+localedir = $(datarootdir)/locale
+bindir = $(exec_prefix)/bin
+libexecdir = $(exec_prefix)/libexec
+sitedir = $(DESTDIR)/Library/Ruby/Site
+htmldir = $(docdir)
+vendorarchdir = $(vendorlibdir)/$(sitearch)
+includedir = $(prefix)/include
+infodir = $(DESTDIR)/usr/share/info
+vendorlibdir = $(vendordir)/$(ruby_version)
+sysconfdir = $(prefix)/etc
+libdir = $(exec_prefix)/lib
+sbindir = $(exec_prefix)/sbin
+rubylibdir = $(libdir)/ruby/$(ruby_version)
+docdir = $(datarootdir)/doc/$(PACKAGE)
+dvidir = $(docdir)
+vendordir = $(libdir)/ruby/vendor_ruby
+datarootdir = $(prefix)/share
+pdfdir = $(docdir)
+archdir = $(rubylibdir)/$(arch)
+sitearchdir = $(sitelibdir)/$(sitearch)
+datadir = $(datarootdir)
+localstatedir = $(prefix)/var
+sitelibdir = $(sitedir)/$(ruby_version)
+
+CC = gcc
+LIBRUBY = $(LIBRUBY_SO)
+LIBRUBY_A = lib$(RUBY_SO_NAME)-static.a
+LIBRUBYARG_SHARED = -l$(RUBY_SO_NAME)
+LIBRUBYARG_STATIC = -l$(RUBY_SO_NAME)
+
+RUBY_EXTCONF_H = 
+CFLAGS   =  -fno-common -arch i386 -arch x86_64 -g -Os -pipe -fno-common -DENABLE_DTRACE  -fno-common  -pipe -fno-common $(cflags) 
+INCFLAGS = -I. -I$(topdir) -I$(hdrdir) -I$(srcdir)
+DEFS     = 
+CPPFLAGS =   -D_XOPEN_SOURCE -D_DARWIN_C_SOURCE $(DEFS) $(cppflags)
+CXXFLAGS = $(CFLAGS) 
+ldflags  = -L. -arch i386 -arch x86_64 
+dldflags = 
+archflag = 
+DLDFLAGS = $(ldflags) $(dldflags) $(archflag)
+LDSHARED = cc -arch i386 -arch x86_64 -pipe -bundle -undefined dynamic_lookup
+AR = ar
+EXEEXT = 
+
+RUBY_INSTALL_NAME = ruby
+RUBY_SO_NAME = ruby
+arch = universal-darwin10.0
+sitearch = universal-darwin10.0
+ruby_version = 1.8
+ruby = /System/Library/Frameworks/Ruby.framework/Versions/1.8/usr/bin/ruby
+RUBY = $(ruby)
+RM = rm -f
+MAKEDIRS = mkdir -p
+INSTALL = /usr/bin/install -c
+INSTALL_PROG = $(INSTALL) -m 0755
+INSTALL_DATA = $(INSTALL) -m 644
+COPY = cp
+
+#### End of system configuration section. ####
+
+preload = 
+
+libpath = . $(libdir)
+LIBPATH =  -L. -L$(libdir)
+DEFFILE = 
+
+CLEANFILES = mkmf.log
+DISTCLEANFILES = 
+
+extout = 
+extout_prefix = 
+target_prefix = 
+LOCAL_LIBS = 
+LIBS = $(LIBRUBYARG_SHARED)  -lpthread -ldl  
+SRCS = prime.c
+OBJS = prime.o
+TARGET = better_prime
+DLLIB = $(TARGET).bundle
+EXTSTATIC = 
+STATIC_LIB = 
+
+BINDIR        = $(bindir)
+RUBYCOMMONDIR = $(sitedir)$(target_prefix)
+RUBYLIBDIR    = $(sitelibdir)$(target_prefix)
+RUBYARCHDIR   = $(sitearchdir)$(target_prefix)
+
+TARGET_SO     = $(DLLIB)
+CLEANLIBS     = $(TARGET).bundle $(TARGET).il? $(TARGET).tds $(TARGET).map
+CLEANOBJS     = *.o *.a *.s[ol] *.pdb *.exp *.bak
+
+all:		$(DLLIB)
+static:		$(STATIC_LIB)
+
+clean:
+		@-$(RM) $(CLEANLIBS) $(CLEANOBJS) $(CLEANFILES)
+
+distclean:	clean
+		@-$(RM) Makefile $(RUBY_EXTCONF_H) conftest.* mkmf.log
+		@-$(RM) core ruby$(EXEEXT) *~ $(DISTCLEANFILES)
+
+realclean:	distclean
+install: install-so install-rb
+
+install-so: $(RUBYARCHDIR)
+install-so: $(RUBYARCHDIR)/$(DLLIB)
+$(RUBYARCHDIR)/$(DLLIB): $(DLLIB)
+	$(INSTALL_PROG) $(DLLIB) $(RUBYARCHDIR)
+install-rb: pre-install-rb install-rb-default
+install-rb-default: pre-install-rb-default
+pre-install-rb: Makefile
+pre-install-rb-default: Makefile
+$(RUBYARCHDIR):
+	$(MAKEDIRS) $@
+
+site-install: site-install-so site-install-rb
+site-install-so: install-so
+site-install-rb: install-rb
+
+.SUFFIXES: .c .m .cc .cxx .cpp .C .o
+
+.cc.o:
+	$(CXX) $(INCFLAGS) $(CPPFLAGS) $(CXXFLAGS) -c $<
+
+.cxx.o:
+	$(CXX) $(INCFLAGS) $(CPPFLAGS) $(CXXFLAGS) -c $<
+
+.cpp.o:
+	$(CXX) $(INCFLAGS) $(CPPFLAGS) $(CXXFLAGS) -c $<
+
+.C.o:
+	$(CXX) $(INCFLAGS) $(CPPFLAGS) $(CXXFLAGS) -c $<
+
+.c.o:
+	$(CC) $(INCFLAGS) $(CPPFLAGS) $(CFLAGS) -c $<
+
+$(DLLIB): $(OBJS)
+	@-$(RM) $@
+	$(LDSHARED) -o $@ $(OBJS) $(LIBPATH) $(DLDFLAGS) $(LOCAL_LIBS) $(LIBS)
+
+
+
+$(OBJS): ruby.h defines.h

data/ext/extconf.rb

@@ -0,0 +1,5 @@
+require 'mkmf'
+
+extension_name = 'better_prime'
+dir_config(extension_name)
+create_makefile(extension_name, '.')

data/ext/prime.c

@@ -0,0 +1,115 @@
+#include <stdbool.h>
+
+#include "ruby.h"
+
+typedef unsigned long long ullong;
+
+ullong
+expmod(ullong base, ullong exponent, ullong modulus)
+{
+  ullong result = 1;
+  while(exponent > 0) {
+    if ((exponent & 1) == 1) {
+      result = (result * base) % modulus;
+    }
+    exponent >>= 1;
+    base = (base * base) % modulus;
+  }
+  return result;
+}
+
+VALUE
+mrprime(VALUE obj)
+{
+  rb_require("better_prime/mr_prime");
+  VALUE mrprime = rb_define_class("MR_Prime", rb_cObject);
+  return rb_funcall(mrprime, rb_intern("[]"), 1, obj);
+}
+
+/* Miller-Rabin algorithm to determine primality of a number.
+ * Uses values for a that guarantee correct results up to 314T.
+ * Above that, uses ryan@ryanneufeld.ca's Mr.Prime.
+ */ 
+VALUE
+integer_is_prime(VALUE self)
+{
+  if (!FIXNUM_P(self)) {
+    return mrprime(self);
+  }
+
+  ullong n = NUM2ULL(self);
+  
+  int *primes;
+  int nprimes;
+  int k, i, j;
+  ullong m, b;
+  bool prime;
+  
+  static int primes_1[] = {2, 3};
+  static int primes_2[] = {31, 73};
+  static int primes_3[] = {2, 7, 61};
+  static int primes_4[] = {2, 3, 5, 7, 11};
+  static int primes_5[] = {2, 3, 5, 7, 11, 13};
+  static int primes_6[] = {2, 3, 5, 7, 11, 13, 17};
+  
+  if (n < 2) {
+    return Qfalse;
+  } else if (n < 4) {
+    return Qtrue;
+  } else if (n < 1373653) {
+    primes = primes_1;
+    nprimes = 2;
+  } else if (n < 9080191) {
+    primes = primes_2;
+    nprimes = 2;
+  } else if (n < 4759123141ULL) { 
+    primes = primes_3;
+    nprimes = 3;
+  } else if (n < 2152302989747ULL) {
+    primes = primes_4;
+    nprimes = 5;
+  } else if (n < 3474749660383ULL) {
+    primes = primes_5;
+    nprimes = 6;
+  } else if (n < 341550071728321ULL) {
+    primes = primes_6;
+    nprimes = 7;
+  } else {
+    // Quick, do something sensible!
+    return mrprime(self);
+  }
+
+  k = 0;
+  m = n - 1;
+  while (m & 1) {
+    m >>= 1;
+    k += 1;
+  }
+
+  for (i = 0; i < nprimes; i++) {
+    b = expmod(primes[i], m, n);
+
+    if (b != 1) {
+      prime = false;
+      for (j = 0; j < k; j++) {
+        if (b == n - 1) {
+          prime = true;
+          break;
+        }
+        b = expmod(b, 2, n);
+      }
+      if (!prime) {
+        return Qfalse;
+      }
+    }
+  }
+  
+  return Qtrue;
+}
+
+void
+Init_better_prime()
+{
+  VALUE cNumeric = rb_define_class("Numeric", rb_cObject);
+  rb_define_method(cNumeric, "prime?", integer_is_prime, 0);
+}

data/lib/better_prime/mr_prime.rb

@@ -0,0 +1,119 @@
+# Thanks Bruce Schneier for this gem
+def exponent_mod(base,exponent,modulus)
+  result = 1;
+  while(exponent > 0) 
+    if ((exponent & 1) == 1) 
+      result = (result * base) % modulus;
+    end
+    exponent >>= 1;
+    base = (base * base) % modulus;
+  end
+
+  return result;
+end
+
+
+# Test r&s can reconstitute n properly
+class MR_Prime
+  attr_accessor :number
+  attr_reader :r,:s,:trials
+
+  # Allow for easier access to instance of class via MR_Prime[n]
+  def self.[](n,opts={})
+    MR_Prime.new(n,opts).prime?
+  end
+
+  def self.trials_for_precision(prec)
+    k = 1
+    while( 1.0 / (4.0 ** k) > prec)
+      k += 1
+    end
+    return k
+  end
+
+  def initialize(n,opts={})
+    self.number = n
+    set_trials(opts)
+  end
+
+  def witnessed_by?(a)
+    result = exponent_mod(a,@s,@number)
+    if result == 1
+      return true
+    else
+      0.upto(@r-1) do |j|
+        result = exponent_mod(a,(2**j)*@s,@number)
+        if result == -1 or result == @number - 1
+          return true
+        end
+      end
+    end
+    return false
+  end
+
+  def number=(n)
+    @number = n
+    resolve_r_and_s
+  end
+
+  def prime?
+    witnesses.all? { |a| witnessed_by? a }
+  end
+
+#private
+
+  # Set the number of trials to the max of num required for precision, witnesses opt, or 19 (giving at max 1.0e-10 chance of failure)
+  def set_trials(opts)
+    trials = [19] # default precision of 0.00000000036% chance of failure
+    if opts[:precision]
+      if opts[:precision] == 0 # Short circuit of absolute precision is required
+        @absolute = true
+        @trials = -1
+        return
+      else
+        trials.push(MR_Prime.trials_for_precision(opts[:precision]))
+      end
+    end
+    trials.push(opts[:witnesses]) if opts[:witnesses]
+    @trials = trials.max
+  end
+
+  # Find R and S such that 2^r * s + 1 == @number (as per MR def'n)
+  def resolve_r_and_s
+    @r,@s=0,@number-1
+    while(@s.even?)
+      @r += 1
+      @s /= 2
+    end
+  end
+
+  # Witnesses require for absoulte certainty for any number < key
+  #  OR
+  # the number of trials specified by :witnesses or :precision arguments
+  # Source Wikipedia and "The Primes Page"
+  def witnesses
+    witnesses = []
+    if @number < 1_373_653
+      witnesses = [2,3]
+    elsif @number < 9_080_191
+      witnesses = [31,73]
+    elsif @number < 4_759_123_141
+      witnesses = [2,7,61]
+    elsif @number < 2_152_302_898_747
+      witnesses = [2,3,5,7,11]
+    elsif @number < 3_474_749_660_383
+      witnesses = [2, 3, 5, 7, 11, 13]
+    elsif @number < 341_550_071_728_321
+      witnesses = [2, 3, 5, 7, 11, 13, 17]
+    elsif @precision
+      witnesses = (2...@number)
+    else
+      witnesses = Array.new(@trials).map { rand(@number-1)+1 }
+    end
+    return witnesses
+  end
+end
+
+if __FILE__ == $0 and !ARGV.empty?
+  puts MR_Prime[ARGV.shift.to_i]
+end

metadata

@@ -0,0 +1,61 @@
+--- !ruby/object:Gem::Specification 
+name: better_prime
+version: !ruby/object:Gem::Version 
+  version: 0.0.1
+platform: ruby
+authors: 
+- Burke Libbey
+- Ryan Neufeld
+autorequire: 
+bindir: bin
+cert_chain: []
+
+date: 2009-12-07 00:00:00 -06:00
+default_executable: 
+dependencies: []
+
+description: An Uber-fast primality testing library.
+email: burke@burkelibbey.org
+executables: []
+
+extensions: 
+- ext/extconf.rb
+extra_rdoc_files: []
+
+files: 
+- Rakefile
+- VERSION
+- ext/Makefile
+- ext/extconf.rb
+- ext/prime.c
+- lib/better_prime/mr_prime.rb
+has_rdoc: true
+homepage: http://github.com/burke/better_prime
+licenses: []
+
+post_install_message: 
+rdoc_options: 
+- --charset=UTF-8
+require_paths: 
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement 
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      version: "0"
+  version: 
+required_rubygems_version: !ruby/object:Gem::Requirement 
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      version: "0"
+  version: 
+requirements: []
+
+rubyforge_project: 
+rubygems_version: 1.3.5
+signing_key: 
+specification_version: 3
+summary: An Uber-fast primality testing library.
+test_files: []
+