Is Integer Factorization in P? | Manifold

Is Integer Factorization in P?

Plus

29

Ṁ2825

3000

13%

chance

1D

1W

1M

ALL

This market will resolve once a widely-accepted proof exists that the integer factorization problem is or is not in P.

Computational Complexity Theory Cryptography

Get Ṁ1,000 play money

Sort by:

Related market I made: https://manifold.markets/FedorBeets/will-someone-find-an-efficient-algo

Comment hidden

Related questions

Is Integer Factorization NP-Complete?

Can integer factorization be solved in polynomial time on a classical computer?

In what year will the 1801st Fibonacci number be fully factorized?

What are the prime factors of RSA-2048?

Is Integer Factorization NP-Complete?

Will a polynomial time factoring algorithm be found by 2035?

Will the reality of DMT worlds be confirmed using prime factorization?

Related questions

Is Integer Factorization NP-Complete?

Is Integer Factorization NP-Complete?

Can integer factorization be solved in polynomial time on a classical computer?

Will a polynomial time factoring algorithm be found by 2035?

In what year will the 1801st Fibonacci number be fully factorized?

Will the reality of DMT worlds be confirmed using prime factorization?

What are the prime factors of RSA-2048?