4 ms·
Somebody else will need to fill in details, but I do recall reading there's a general argument that if your proof-of-work compute provides something else of val
by TeMPOraL 6y ago
Somebody else will need to fill in details, but I do recall reading there's a general argument that if your proof-of-work compute provides something else of value as a side effect (e.g. "quantum chemistry simulations"), it stops being a good proof-of-work scheme.
I can also imagine that anything non-random is vulnerable to a discovery of a more efficient method of computing the same thing, and the first person to exploit such a method could take over the chain.
- rabuse 6y agoThis is correct. Without the brute-forcing nature of finding a solution for a block, it becomes trivial to game. There may be a hybrid approach to it (PoS), but they haven't proven themselves yet in a large scale.