YAFU
[[File:{{#setmainimage:Yafu.jpg}}|alt=YAFU logo image|center|frameless]]
YAFU is a volunteer distributed computing project based on BOINC that focuses on large scale integer factorization. The project is closely associated with the study of aliquot sequences and uses donated computing power from volunteers around the world to factor composite numbers up to approximately 149 digits in length.
The project uses the YAFU integer factorization software package developed by Ben Buhrow. YAFU integrates several advanced algorithms and external mathematics libraries to automatically select the most efficient factorization method for a given composite number.[1]
Why YAFU?
Integer factorization is an important problem in computational number theory. Many unsolved mathematical questions depend on the ability to decompose very large composite integers into their prime factors. Efficient factorization methods also have practical importance in cryptography, especially in systems such as RSA where security depends on the difficulty of factoring large semiprime numbers.[2]
YAFU contributes to the mathematical study of aliquot sequences, which are iterative sequences formed by repeatedly applying the sum of proper divisors function:
where is the divisor sum function. Beginning with an integer , each subsequent term is generated by summing all proper divisors of the previous term.
Some aliquot sequences terminate at 1, some enter cycles, and others appear to grow indefinitely. Understanding their long term behavior remains an open problem in number theory.[3]
Goal
YAFU's primary goal is to factorize composite numbers arising from ongoing aliquot sequence calculations. The project especially targets composite cofactors up to approximately 149 digits in size in order to extend and maintain known aliquot sequences.
The long term objective is to assist collaborative efforts to bring all known aliquot sequences with starting values below several million to a minimum size threshold of 140 digits or greater. This helps mathematicians determine whether sequences terminate, merge with other sequences, or continue growing.[4]
History
The YAFU BOINC project was launched by the BOINC community member known as "yoyo", who has also operated several other mathematics oriented BOINC projects. The project became associated with the German distributed computing organization Rechenkraft.net e.V., which supports collaborative computational mathematics and citizen science initiatives.[5]
YAFU evolved from standalone factorization work into a BOINC enabled distributed system capable of processing very large batches of integer factorization tasks using volunteer CPU resources.
Methods
YAFU uses several advanced integer factorization algorithms depending on the size and structure of the composite number being processed. These include:
- Elliptic Curve Method (ECM)
- Multiple Polynomial Quadratic Sieve (MPQS)
- General Number Field Sieve (GNFS)
- Pollard's rho algorithm
- Trial division and primality testing
For a composite integer , the project seeks a decomposition of the form:
where each is prime.
The General Number Field Sieve is currently the fastest known classical algorithm for factoring very large integers and is frequently required for the most difficult YAFU work units.[6]
YAFU uses BOINC because integer factorization workloads can be split into many independent tasks and distributed efficiently across thousands of volunteer computers. This allows the project to achieve computational throughput far beyond what would normally be available to individual researchers or small academic teams.
Unlike many GPU accelerated BOINC projects, YAFU primarily relies on CPU computation because several factorization algorithms benefit heavily from large integer arithmetic performance, memory bandwidth, and highly optimized multi precision libraries.
Volunteer computing
YAFU is part of the broader BOINC ecosystem of volunteer computing projects. Volunteers install the BOINC client software and receive work units automatically from the project's servers. Completed factorization results are returned to the server and incorporated into larger aliquot sequence databases and factorization records.
The project demonstrates how distributed volunteer computing can contribute to pure mathematics research without requiring centralized supercomputing infrastructure. Participants also contribute to the preservation and extension of public mathematical databases such as FactorDB.[7]
Project team / Sponsors
The project is operated primarily by the BOINC developer and administrator known as "yoyo" with support from Rechenkraft.net e.V., a German nonprofit organization dedicated to distributed computing and scientific volunteer projects.
Scientific significance
Aliquot sequences have been studied since the time of ancient Greek mathematics and remain an active area of research in computational number theory. YAFU contributes computational resources toward understanding several unresolved mathematical questions related to sequence termination, cyclic behavior, and unbounded growth.
The project also contributes benchmark data for evaluating the performance of modern integer factorization algorithms and large scale distributed mathematics applications.
Several publications and conference papers related to BOINC, distributed computing, and integer factorization are relevant to YAFU and its computational methods:
- David P. Anderson. "BOINC: A System for Public Resource Computing and Storage."[8]
- Arjen K. Lenstra and Hendrik W. Lenstra Jr. "The Development of the Number Field Sieve."[9]
- Richard Crandall and Carl Pomerance. "Prime Numbers: A Computational Perspective."[10]
See also
External links
References
- ↑ YAFU project page. SourceForge. Retrieved 2026-05-25}.
- ↑ (2005}).Prime Numbers: A Computational Perspective. Springer. ISBN 9780387252827.
- ↑ Guy, Richard K..(2004}).Unsolved Problems in Number Theory.
- ↑ Current status of aliquot sequences. Rechenkraft.net. Retrieved 2026-05-25}.
- ↑ Rechenkraft.net e.V.. Retrieved 2026-05-25}.
- ↑ Lenstra, Arjen K..(1993}).The Development of the Number Field Sieve.
- ↑ Factor Database. Retrieved 2026-05-25}.
- ↑ Anderson, David P..(2004}).BOINC: A System for Public Resource Computing and Storage. Proceedings of the Fifth IEEE/ACM International Workshop on Grid Computing. DOI: 10.1109/GRID.2004.14.
- ↑ (1993}).The Development of the Number Field Sieve. Springer. ISBN 9783540570769.
- ↑ (2005}).Prime Numbers: A Computational Perspective. Springer. ISBN 9780387252827.