2 ms·
It hasn't taken off because it doesn't work. PoW only works for things that are hard to calculate but easy to verify. Any meaningful result is equally hard to v
by Kiro 5y ago
It hasn't taken off because it doesn't work. PoW only works for things that are hard to calculate but easy to verify. Any meaningful result is equally hard to verify.
- petters 5y ago> Any meaningful result is equally hard to verify. This is very much not true. A central class in complexity is NP whose problems are hard to answer but easy to verify if the answer is yes. E.g. is there a path visiting all nodes in this graph of length less than 243000? Hard to answer but easy to check any proposed answer.
- snovv_crash 5y agoIt's easy to verify ML training - inference on a test set has lower error than it did before. Training NN ML is much slower than inference (1000x at least) because it has to calculate all of the gradients.