I made a deterministic π-driven algorithm that solves Partition in O(log n)(osf.io)

I made a deterministic π-driven algorithm that solves Partition in O(log n)

https://osf.io/mubnv/

2 comments

Partition is NP-complete. I built a deterministic polynomial algorithm: a variant of my O(n²) solver, now running in O(log n) time and O(1) extra space. More elements → runtime grows slower.

Implications: breaks RSA, ECC, AES, SHA-256, blockchain security and beyond.

[deleted]10 mesi fa