Will a polynomial time factoring algorithm be found by 2035?
50
1.4kṀ25722035
9%
chance
1H
6H
1D
1W
1M
ALL
Not too much more to say. Resolves Yes if there's an algorithm that can factor big integers before 2035 in polynomial time on a classical computer. Resolves No if it's 2035 and there's still no algorithm.
This question is managed and resolved by Manifold.
Get 
1,000 to start trading!
1,000People are also trading
Related questions
Will the prime factors of RSA-1024 be known by 2030?
21% chance
Will the prime factors of RSA-2048 be known before 2030?
14% chance
Will a polynomial-time algorithm for an NP-complete problem be published by 2030?
4% chance
Can integer factorization be solved in polynomial time on a classical computer?
10% chance
Will a quantum computer factor the RSA-2048 challenge number before 2035?
47% chance
Will a quantum computer factor the RSA-2048 challenge number before 2030?
11% chance
Will a quantum computer factor the RSA-2048 challenge number before 2050?
81% chance
Will a quantum computer factor the RSA-2048 challenge number before 2075?
78% chance
Will a quantum computer factor the RSA-2048 challenge number before 2045?
66% chance
In what year will the 1801st Fibonacci number be fully factorized?