3 ms·
It doesn't really work that way. For PoW you dont just need work, you need work that can be easily verified, easily scaled difficulty levels, and difficult to
by bawolff 4y ago
It doesn't really work that way.
For PoW you dont just need work, you need work that can be easily verified, easily scaled difficulty levels, and difficult to cheat with - all with no centralized trusted authority.
Even when SETI/F@H was worth only fake internet points they already had problems with people cheating. What happens when its worth real money?
- blaaaaa99a 4y agothere should be ways to achieve this. examples would be: Multiple PoWers independently producing solutions and then verifying each other (although this is wasteful as work is being duplicated) PoWers achieving increasing status levels when not cheating over time, incentivising long-term honest behaviour
- toomuchtodo 4y agoThis is how BOINC and similar distributed computing projects work: a unit of work is distributed to multiple workers to confirm the work and discourage malicious actors.
- ithinkso 4y agoThe other very important part of BOINC and the like is that they offer no monetary gains for your contribution. That's how you eliminate 99,9% of malicious actors and the rest can be eliminated the way you described It won't work in the PoW scheme because there is presumably some cryptocurrency involved as a reward
- bawolff 4y agoAnd how do you make sure that a single person doesnt create multiple accounts in order to also be the verifier of their own work? Since that is the entire problem PoW is trying to solve, if you have a solution to that, why not just use it directly? > PoWers achieving increasing status levels when not cheating over time, incentivising long-term honest behaviour We're talking millions of dollars here (if not more). In the real world people would easily spend years doing a long-con with that type of pay out. Why wouldn't they do so on the internet?
- bilsbie 4y agoWe could find new primes at least. Really any NP complete problems would be easy to verify by definition.
- bawolff 4y agoYou dont just need easy to verify, you need easy to fairly distribute the problem instances. Take primes. How do you know the person generated new primes and didnt just have a bunch saved up? With hashes you have to hash the current block which is unpredictable, and also means as time goes on it gets harder and harder to have a competing chain, because you dont just have to solve the current block but also be better for all the preceeding chains. Additionally NP-complete problems are hard because the average complexity tends not to be super hard, which is a major sticking point in this application. So you have to somehow verify the person is solving a hard instance of the problem and not an easy instance.
- prox 4y agoCan’t you have the chain do multiple random verifications before accepting it?
- duskwuff 4y agoFinding prime numbers, even very large ones, is neither difficult nor useful; there are simple algorithms for determining the primality of a number which don't require extraordinary amounts of computing power to execute. Even factoring large semiprimes isn't inherently useful -- it's an interesting mathematical exercise, but isn't a goal unto itself.
- SkyMarshal 4y agoIn addition, you need something that deliberately has no other value besides doing PoW. Otherwise, all of that cryptocurrency's mining power could instantly abandon that cryptocurrency for the other thing if market flucations give it a higher ROI than PoW.
- sebzim4500 4y ago>In addition, you need something that deliberately has no other value besides doing PoW. This doesn't really exist though, since you can heat a house with a mining rig. It's no less efficient than resistive heating.
- deleted 4y ago[deleted]
- dieortin 4y agoTechnically it IS resistive heating