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 hackcasual on Thursday April 27, 2023 @10:49AM (#35728988)
Only works if they have been moved. Addresses start out as hashes of ECC keys, not the keys themselves
[ Parent | on HN ]
Re:The 2-Maxsat Problem Can Be Solved in Polynomial Time by Strilanc on Thursday April 27, 2023 @11:36AM (#35729699)
The problem of "find a series of bytes that is a valid transaction sending these bitcoins to me" is an NP problem. When you can solve arbitrary "find satisfying input" problems, details like "the public key is hashed" don't matter. It's adjusting what it means to be valid, not changing the nature of the problem to be out of scope of "find satisfying input".
[ Parent | on HN ]
Re:The 2-Maxsat Problem Can Be Solved in Polynomial Time by tromp on Thursday April 27, 2023 @11:51AM (#35729917)
Besides, Satoshi's coins are P2PK (Pay to Public Key), not P2PKH (Pay to Public Key Hash), so the point is moot.
[ Parent | on HN ]