3 ms·
It is, some people also tried SAT solvers for mining: http://jheusser.github.io/2013/02/03/satcoin.html http://jheusser.github.io/2013/02/03/satcoin.html
by xiphias 10y ago
It is, some people also tried SAT solvers for mining:
http://jheusser.github.io/2013/02/03/satcoin.html http://jheusser.github.io/2013/02/03/satcoin.html
- wolfgke 10y agoPlease look up the definition of NP-hardness again. If the problem (#) := "finding a nonce that makes the block have a SHA256 with many leading zeroes" was NP-hard, it would be an interesting idea to use a solver for (#) to solve e.g. SAT (not the other way round!). TLDR: You talked about the wrong inclusion.