nostr:nprofile1qy2hwumn8ghj7un9d3shjtnyd968gmewwp6kyqpq7yf7cxzxz4kwf24zmflvyqqtrylsjwm5q9a074u5ger57rmzz0aqe544dh The article claims that factorisation takes exponential time, I.e., is proportional to e^(an) where a is a constant and n is the number of bits in the number to be factored. But that's n...