Search Results for "mersenne"
Sort By:
Showing 18 open source projects for "mersenne"
View related business solutions-
$300 Free Credits to Build on Google CloudPut your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
-
Custom VMs From 1 to 96 vCPUs With 99.95% UptimeLive migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
-
1
Prime95
Precision CPU stress testing and benchmarking
Prime95 is a popular software tool used primarily for stress testing and benchmarking computer processors by running intense calculations based on the Mersenne prime search algorithm. This rigorous testing helps users gauge system stability and detect potential issues, particularly useful for overclockers, hardware testers, and enthusiasts aiming for optimal CPU performance. -
2
Apache OpenOffice
The free and Open Source productivity suite
Free alternative for Office productivity tools: Apache OpenOffice - formerly known as OpenOffice.org - is an open-source office productivity software suite containing word processor, spreadsheet, presentation, graphics, formula editor, and database management applications. OpenOffice is available in many languages, works on all common computers, stores data in ODF - the international open standard format - and is able to read and write files in other formats, included the format used by the... -
3
mers
Portable software and data related to Mersenne numbers
Portable software related to Mersenne numbers. Useful to automate certain tasks related to GIMPS (www.mersenne.org) for computers that cannot run the GIMPS software for whatever reason. Much of the code has been in use since 1990 or so by a few people. The project web site at https://mers.sourceforge.io/mersenne.html has data about Mersenne numbers from many people generated by this and other software, notably from the GIMPS project. -
4
Statistics for MySQL
Add more statistical functions to MySQL.
"Statistics for MySQL" provides additional statistical functions (like Pearson's coefficient of correlation) which are missing in MySQL. DLLs for 32 and 64bit Windows as well as makefiles for Linux are available. -
99.99% Uptime for MySQL and PostgreSQL DatabasesCloud SQL Enterprise Plus delivers near-zero downtime with 35 days of point-in-time recovery. Supports MySQL, PostgreSQL, and SQL Server.
-
5
Mersenne Prime Finder
Finds Mersenne Prime Numbers Automatically
Finds Mersenne Prime Numbers Automatically. The code was designed in Python -
6
CUDALucas
A program that uses CUDA to accelerate the Lucas Lehmer test.
CUDALucas is a program implementing the Lucas-Lehmer primality test for Mersenne numbers using the Fast Fourier Transform implemented by nVidia's cuFFT library. You need a CUDA-capable nVidia card with compute compatibility >= 1.3 up to CUDA 6.5, 2.x up to 7.0 and 3.x for >=CUDA 8.0 . The program is run from the command line, however it can be configured without using a terminal. See the Wiki for more details. -
7
RandomLib
Random number library
RandomLib is a C++ interface to the Mersenne Twister random number generator MT19937 and to the SIMD-oriented Fast Mersenne Twister random number generator, SFMT19937. For documentation, visit http://randomlib.sf.net -
8
Jafaran
Fast and more random implementations of java.util.Random.
...Doornik paper, 2005), used by nextGaussian() methods of the provided implementations. Requires Java 5 or later. Also available on github since 2015/12/13: https://github.com/jeffhain/jafaran Principal classes: - Implementations using Mersenne-Twister algorithm (good pseudo-randomness): MTSyncRNG MTSeqRNG - Implementations using Marsaglia Xor-Shift (fast): MXSIntSeqRNG (32 bits) MXSLongSeqRNG (64 bits) (nextLong() faster, larger period) - Ziggurat: Random-based implementation of Ziggurat algorithm. -
9
Prime Finder
Finds Prime Numbers.
Finds Prime Numbers as well as mentioning, if a value is a Sophie Germain Prime or Mersenne Prime. -
Host LLMs in Production With On-Demand GPUsDeploy your model, get an endpoint, pay only for compute time. No GPU provisioning or infrastructure management required.
-
10
Structure Synth generates 3D structures by specifying a design grammar. Even simple systems may generate surprising and complex structures. Structure Synth offers a graphical environment with multiple tabs, syntax highlighting, and OpenGL preview.
-
11
EMsieve
A simple sieve/prefactor program for Eisenstein-Mersenne Primes
A simple sieve/prefactor program for the so-called Eisenstein-Mersenne Primes: 3^p +- 3^((p + 1)/2) + 1. See http://oeis.org/A125738, A125739 and [1] for a good introduction. Some easily established properties are: p must be prime; sign is minus for p=+-1 (mod 12), plus otherwise; composites only have factors of form 6kp+1 (integer k). Related probable primes (3^p -+ 3^((p + 1)/2) + 1)/7 are sieved at the same time. -
12
CUDAPm1
CUDA implementation of P-1 factoring for Mersenne numbers
CUDAPm1 is a modification of CUDALucas that implements the P-1 factoring algorithm for Mersenne numbers using the Fast Fourier Transform implemented by nVidia's cuFFT library. You need a CUDA-capable nVidia card with compute compatibility >= 1.3. -
13
SimulME is a Java ME (J2ME) application with Queueing calculator, Stopwatch, Monte Carlo simulation, Random Number Generator (RNG), Probability distributions, Kolmogorov-Smirnov and Chi-square tests. It works with MIDP 2.0 and CLDC 1.1 profiles.
-
14
BoCrypto encrypts/decrypts files using one-time-pad keys. Mersenne Twist PRNG is utilized for the key stream. Features enc/dec benchmarking as well as 'duress' key generation. OTP encryption is the only unbreakable encryption, if implemented correctly.
-
15
gkrellmGIMPS is a plugin for the GKrellM monitoring tool. It measures the progress of a client participating in the Great Internet Mersenne Prime Search (GIMPS).
-
16
Glucas is a client to make primality test for Mersenne numbers. It is related to GIMPS effort to search the bigest primes ever found. In addition, it can be used as an excellent performance test. Posix thread, OpenMP and SunMP compatible
-
17
Simd oriented Fast Mersenne Twister Random generator for Cell processor This library is an implementation of the SFMT http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/SFMT/ The objective is to create a fast pseudo-random generator for the Cell Processor
-
18
Fast-Fourier-Transform-based number theory code to test Mersenne numbers for primality using the Lucas-Lehmer test and the Crandall-Fagin irrational-base discrete weighted transform (IBDWT) algorithm (Math. Computation 62 (205), pp.305-324, January 1994)
- Previous
- You're on page 1
- Next