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.
KaoruAK•1h ago
Implications: breaks RSA, ECC, AES, SHA-256, blockchain security and beyond.