RSA-256
https://manifold.markets/dieselbaby1337/will-a-quantum-computer-prove-capab
Is there a difference between these two markets?
@Dig As another comment hinted, a modulus of this size has already been factored by a classical computer decades ago.
IMHO, seems like this market should probably resolve YES on account of this fact. Perhaps you would say that this doesn't meet the criteria because "quantum computing" wasn't involved? But in that case, it seems like we should clarify what qualifies as "quantum computing" here.
@BoltonBailey Yes, I'd say it resolves YES on this basis. RSA-256 is trivially broken on a laptop, and if you arbitrarily involve a quantum computer with one of the steps (adding two small numbers...) then you've just used a quantum computer to break RSA-256