The data demonstrates a high-performance computing effort, likely using a cluster of cutting-edge NVIDIA GPUs (specifically the Blackwell architecture, mentioning B200, GB200, and GB300 nodes) to handle the most computationally expensive parts of the process.
Here is a summary of the most significant accomplishments listed in the data:
1. Key Factorization Records
- RSA-260: The report confirms the factorization of the 260-digit RSA challenge number into two 130-digit primes. This is a major milestone in the cryptography community, as it pushes the known limits of the GNFS.
- C385 ($2^{1277}-1$): This is highlighted as a "new record for SNFS." Because this number has a special form, the Special Number Field Sieve was used to break it into three primes (106, 117, and 163 digits).
- C344 and C311: These are "Mersenne-like" numbers (of the form $(a^n-1)/b$). C344 was factored into primes of 136 and 209 digits.
- C201: Described as an "odd perfect number roadblock," meaning this number was likely a candidate in the search for odd perfect numbers.
2. Technical Process (The NFS Pipeline)
The logs show the standard stages of the Number Field Sieve algorithm:
- Polyselect: Finding optimal polynomials $f(x)$ and $g(x)$ to represent the number. (Mention of "MurphyE" refers to the Murphy $\alpha$ value, used to estimate polynomial efficiency).
- Sieve: The most time-consuming part, where "relations" are found. The logs show billions of raw relations being collected.
- Filtering: Removing redundant relations and reducing the size of the matrix.
- Linear Algebra (Krylov/Lingen): This is where the GPUs (B200/GB200) are used. They solve a massive sparse matrix over GF(2) to find dependencies.
- Sqrt (Square Root): The final step that yields the actual prime factors.
3. Hardware and Performance
The report is particularly notable for its use of NVIDIA Blackwell GPUs:
- GPU-Days: The "total" time for RSA-260 is listed as approximately 4,923 GPU-days.
- Accelerators: The mention of GB300 nodes suggests the use of the newest generation of AI/HPC hardware to accelerate the linear algebra phase (the Krylov subspace method), which is typically the bottleneck in GNFS.
Summary Table
| Target | Digits | Type | Result | Significance |
|---|---|---|---|---|
| C190 | 190 | Random Semiprime | $p95 \times p95$ | Standard GNFS test |
| C201 | 201 | Semiprime | $p66 \times p136$ | Roadblock for Odd Perfect Number search |
| RSA-260 | 260 | RSA Challenge | $p130 \times p130$ | Major Cryptographic Milestone |
| C311 | 311 | SNFS form | $p105 \times p207$ | Large SNFS factorization |
| C344 | 344 | SNFS form | $p136 \times p209$ | Large SNFS factorization |
| C337 | 337 | SNFS form | $p91 \times p247$ | Cofactor of $2^{1207}-1$ |
| C385 | 385 | SNFS form | $p106 \times p117 \times p163$ | New SNFS Record |
Groetjes,