Sign into an existing account

This is the p/x approach I was exploring early on. It has been trimmed a bit but for the most part it is undocumented, and largely uncommented, with lots of cruft and deadwood sections--You've been warned.

Meant to be run and explored in-console rather than run as is.

https://files.catbox.moe/1isvyp.py

Do you have what it takes to find a function or equation that links the known set to the unknown set?

edit:
Some explaination.

The unknown set is variables: a, b (in cryptography known as p and q), u, c, t, d4, alpha, beta, etc.

The variables c and d4 are particularly interesting. While it is possible to acquire their quotient c/d4 (given as '_cd4') just from a semiprime itself, the product of c and d4 is the quotient of the factors of the semiprime.
It goes without saying that finding a function that maps c/d4 to -> cd4 in one step, is by extension equivalent to finding a constant-time factorization algorithm, because if cd4==b/a, then it is trivial to follow through with (p/(cd4)).sqrt(), yielding a, where p=a*b

A canonical example is included, starting with a=d(108271), simply because I find equations easier by looking for relations and patterns between actual numbers.

I ran out of recognizable variable names early on and resorted to the periodic table and terms from particle physics.