I'm looking for more semiprimes to test my code on, regardless of the bit length, up to a reasonable number of 2048 bits because the code is unoptimized.

For those wanting to see for themselves if its more failed efforts, heres what you can do to help:

1. post a semiprime
2. optionally post a hash of one of the factors to confirm it.
3. I'll respond within the hour with a set of numbers that contain the first three digits of p and the first three digits of q.
4. After I post my answer, you post the correct answer so others can confirm it is working.

How this works:
All factors of semiprimes can be characterized by a partial factorization of n digits.
If you have a pair of primes like q=79926184211, and p=15106381891, the k=3 pair would be [151, 799]

The set of all digits of this kind is 810,000 pairs.

My answers can be no larger than 2000 pairs, and are guaranteed to contain the partial factorization regardless of the bit length of n.

I especially encourage you to participate if you never thought for a second that the RSA research I've been doing on and off for a few years was ever real.

But those who enjoyed it and thought there might be something to it, if you want to come have fun, or poke fun, I encourage you to post some numbers too!

Semiprimes only.
Keys can be any size up to 2048 bits.
But I won't take any keys under 24 bits, and none over 2048.
You should be able to prove after the fact you know p and q, not only so everyone can confirm the results for themselves, but also because I don't want anyone getting cheeky and posting say the public key to a bank or google or something.

Good luck, lets see if you got a number I can't crack.

For prime numbers you're welcome to use
https://bigprimes.org/

... or any other source you prefer.