WEP-M+2 Project

WEP-M+2 Project
Project
Status	Discontinued
Category	Mathematics, Number theory, Integer factorization
Compute	CPU
Development
Developer	James Wanless
Author	James Wanless
Sponsor	Independent research
Initial release	May 12, 2006  (20 years ago)
Discontinued	January 18, 2024  (2 years ago)
Repository	https://github.com/bearnol/we
Software
Written in	C
Operating system	Windows, Linux
BOINC statistics
Stats as of	November 26, 2023  (3 years ago)
Performance	4,906 GigaFLOPs
Active users	108
Total users	1,981
Active hosts	418
Total hosts	13,776
Metadata
Website	http://bearnol.is-a-geek.com/wanless2/
License	Open source

WEP-M+2 Project was a volunteer distributed computing project based on the BOINC middleware platform.

The project focused on the integer factorization of numbers of the form:

<math>2^p + 1</math>

where <math>p</math> is generally chosen from exponents associated with Mersenne primes. These values are commonly referred to by the project as Mersenneplustwo numbers.

The project distributed computational workloads to volunteers around the world using BOINC clients running on personal computers. Participants contributed idle CPU cycles to help search for non-trivial factors of very large integers.

Overview

WEP-M+2 Project was administered by James Wanless and operated independently as a mathematics-oriented BOINC project. Its primary research interest was the factorization of large numbers related to Mersenne numbers.

Classical Mersenne numbers are integers of the form:

<math>M_p = 2^p - 1</math>

where <math>p</math> is a positive integer. WEP-M+2 instead investigated numbers two greater than a Mersenne number:

<math>N = 2^p + 1</math>

The project attempted to discover integer divisors of these values using distributed computation. Because large exponential integers rapidly become extremely difficult to factor, volunteer computing provided a practical way to perform many parallel tests simultaneously.

Why WEP-M+2 Project?

According to statements published by the project administrator, the project focused on Mersenneplustwo integers because of their mathematical interest and their relationship to computational number theory and integer factorization.

The administrator wrote:

Mersenneplustwo because they’re the most interesting mathematically, especially when it comes to integer factorization.

Goals

The main goal of WEP-M+2 Project was to identify factors of numbers of the form:

<math>2^p + 1</math>

for large values of <math>p</math>. Integer factorization is a major topic in computational mathematics and has applications in cryptography, primality testing, and computational number theory.

The project explored properties of these numbers and catalogued discovered factors. Some results produced by the project were later referenced in discussions related to Mersenne conjectures.

Methods

WEP-M+2 Project used the BOINC infrastructure to distribute computational tasks known as work units to volunteers. Users downloaded the BOINC client software, attached to the project server, and processed mathematical calculations during otherwise idle computer time.

The underlying software and algorithms used by the project were released as open source software on GitHub.

The project administrator described his experience with volunteer computing as follows:

BOINC is sooooo cool. I originally setup a server on spec because I felt I wanted the extra cycles, and when I saw the first wu’s come in over the network even from just my own little local farm, let alone later all the external volunteers, I was hooked for the next 17 years.

The project primarily relied on CPU computation rather than GPU acceleration.

Scientific and mathematical context

The project operated within the field of computational number theory, particularly in the study of large exponential integers and factorization algorithms.

Numbers of the form:

<math>2^p + 1</math>

share similarities with other well-known integer families such as:

• Fermat numbers
• Mersenne primes
• Proth numbers

Large-number factorization projects are computationally intensive because no known efficient classical algorithm exists for factoring arbitrary large integers. Distributed computing projects therefore provide a useful platform for conducting large-scale searches.

Scientific results

The project published factorization discoveries and computational results through the administrator’s mathematics pages.

Some findings from WEP-M+2 Project were referenced externally in discussions concerning Mersenne-related mathematics.

Software and infrastructure

The project used the BOINC distributed computing framework developed at the University of California, Berkeley. BOINC enables scientific projects to harness volunteer computer resources through internet-connected clients.

Participants typically processed work units using the BOINC Manager application on desktop systems running Microsoft Windows or Linux.

Project closure

By early 2024, the original WEP-M+2 Project website was only accessible through the Internet Archive Wayback Machine, indicating that the project had likely ceased active operation.

The GitHub repository and archived pages remain available as historical references to the project and its research efforts.

See also

• BOINC
• Volunteer computing
• Integer factorization
• Mersenne primes
• Distributed computing
• Computational number theory

External links

• Official archived website
• Source code repository
• Mathematical results page
• BOINC official website