What is unsolvable-quadratic-crypto?

This project is a small, playful take on RSA, a well known method for encrypting information. RSA relies on the fact that multiplying two large prime numbers together is easy, but splitting that result back into its two original primes is extremely hard. The author reframes that same hard problem as a quadratic equation, the kind of equation you might solve in school with the quadratic formula, except here the equation is built so that the usual formula will not help you solve it. The idea grew out of the author finding school math boring and wanting to make the underlying difficulty more relatable. Instead of presenting the encryption as abstract numbers and code, it dresses up the same hard math problem as something that looks like ordinary algebra homework, but is secretly just as unsolvable as trying to factor a large number without knowing its prime factors in advance. The README for this project is very short and does not go into implementation details, setup instructions, or usage examples. It appears to be a small, single purpose demonstration rather than a full tool or library meant for everyday use. Because of that, there is not much more to say about how it works internally or how someone would run it, beyond the core idea described above. Anyone curious about the exact mechanics would need to look directly at the project's code rather than the README.