Borz

I'm testing a new RSA factoring idea at toy scale. At 150 bits, the current probe starts with 2,097,755 candidate integers. Classical filtering reduces that to 37 serious candidates. My algoritm reduces those 37 to 2 survivors. No false rejects. The true factor is ranked first. The next step is called Product-Closed Reciprocal Chamber Lock. The idea is simple: A wrong candidate can look locally valid. It can pass endpoint checks. It can survive chamber logic. But when paired with its implied cofactor, it does not actually close the product relation. The correct factor pair is different. Both sides remain stable under reciprocal chamber checks, and together they satisfy: p × q = N So the next algorithmic target is to keep only pairs where local stability and global product closure agree. That is the path from “tiny survivor set” to “single factor pair.”

With codex I don’t need a second monitor I turned it into a standing desk

Free cash flow race to the bottom.