Internet of Events Leaderboard Traders Markets Hot Bets Surveillance Pricing

Log in Get Access

Accrue
/Home
/Manifold Markets
/Can integer factorization be solved in polynomial time on a classical computer?

ManifoldActiveBINARY · cpmm-1

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

Yes10%

Yes Pool

$1K

No Pool

$968

Probability

10%

Volume$765

24h Volume$0

Liquidity$1K

Traders12

CreatorN.C. Young

ClosesDec 31, 2099

View on Manifold →Compare Across Platforms →

Accrue© 2026

Internet of Events Leaderboard Traders Markets Hot Bets Surveillance

The Intelligence Terminal for Prediction Markets

Terms Privacy Risk Disclosure Cookies Disclaimer Acceptable Use