Hacker News new | ask | show | jobs
by koolba 2434 days ago
Can you give an example of a scientifically important problem that can be massively distributed in its calculation yet quick to verify?

The second part of that is the real hitch for mining. You must throw tons of CPU to "mine" the hash but it's a single evaluation to verify it for the proof.

1 comments

Basically any NP problem fits that category. Protein folding is one but so are many other problems. But even if the verification itself is hard (EXP problem) that could still work as at least that energy we are putting into the network will eventually produce an answer (less efficiently, granted!) but it is far better than having energy be for literally 0 gain as the produced outcome right now is tossed out as "junk".
The gain is in the security of the currency. You can argue about how valuable that is, but it is not "literally zero".