News for hackers. Stuff that matters.

A comment on The 2-Maxsat Problem Can Be Solved in Polynomial Time. Parent comment

Re:The 2-Maxsat Problem Can Be Solved in Polynomial Time by jmercan on Friday April 28, 2023 @04:16AM (#35738806)
There is an upper bound in the number of private keys available even if it isn't an issue in practice.

You can target anyone's wallet in O(1) time, no proofs needed :^)

[ Parent | on HN ]

There are no comments on this comment yet.