5 ms·
I agree. I've been racking my brain on ways to connect proof of work to something useful (like folding proteins, general purpose distributed computing, etc.)
by 1001101 9y ago
I agree. I've been racking my brain on ways to connect proof of work to something useful (like folding proteins, general purpose distributed computing, etc.)
- kobeya 9y agoDo that and it would no longer be useful as proof of work. Proof of work-i-was-going-to-do-anyway is not useful for securing the ledger.
- akvadrako 9y agoThat's incorrect. All that matters is you can't game the system by taking shortcuts or deciding what the problem will be beforehand; the work cannot be even partially computable without knowing the previous block.
- spiorf 9y agoBut there is no known function that has these properties and is useful in real world.
- akvadrako 9y agoSure and that puts it in the same camp as PoS and other currently unworkable schemes. A possible way forward; we don't know yet.
- Taek 9y agoNo, you are incorrect. The important aspect of proof of work is that it is very expensive to create an alternate history (maybe one where you didn't send $15,000,000 to the exchange, for example). If you are doing useful work, someone can pay for it, and you can use that payment to make an alternate history for free, defeating the security assumption of blockchains. Blockchains only work by probably wasting in order to build a history. If you aren't wasting, then it wasn't expensive to build the history (it was subsidised), and it wouldn't be expensive to build a different history (that one could also be subsidized)
- SilasX 9y agoBut "socially useful" does not imply saleable (to the bane of venture capitalists everywhere). It's possible for something to provide a social benefit but not make sense for anyone to pay for as a for-profit business because others would get the same benefit and free ride off them. (Hence the problem of public goods in economics.) So if the proof of work is only solving some general research problem, then it might not be feasible to double dip like you've described. That's why primecoin was able to avoid the problem.
- Taek 9y agoPrimecoin also ultimately had limited utility. It found the world's largest prime number thousands of times, continually beating it's own record. At some point we had more prime numbers than had mathematical utility. My unprovable guess is that any other non-sellable problem will ultimately have the same outcome. It's interesting and useful for a bit, but when you have a billion dollars of hardware grinding nonstop for years in a row, you eventually exhaust everything interesting about the original problem and then it's back to the same waste you started with.
- SilasX 9y agoDoesn't that mean it worked too well, and we just need to make a Coin with harder and more useful problems?
- kobeya 9y agoThere are very few things that are actually useful (socially or otherwise) but don't provide economic incentive. As pointed out by others primecoin isn't really a very good example. A good application to shoot for, if there are any budding cryptographers in the audience, is a ticking timelock encryption. A set of keys known in advance, and each block solves the next key. This would let you encrypt messages into the future, where the cost to decrypt is equal to the cost of minting that many blocks. I've seen partial schemes for this, but no complete ones that would justify implementation. If a full and workable scheme could be devised, I would bet on it replacing sha256 based proof of work, eventually.
- SilasX 9y agoThere's primecoin, which uses a proof of work based on finding a special kind of prime number, which (they claim) has use in the outside world, at least the academic one. https://en.wikipedia.org/wiki/Primecoin https://en.wikipedia.org/wiki/Primecoin Generally, to have a useful PoW, it needs to meet some criteria: 1) Easily verifiable 2) Necessary work on the problem is easily quantifiable and estimable 3) Problem can be programmatically generated from random data. One model might be NP-complete problems. Users feed in problem instances they want solved, with a bounty. You find out how many guesses it should take. A valid proof of work then requires solving enough such problems, combined, to exceed the difficulty threshold. (You'd also need to solve one based on the current known transaction history.) The problem there is that it's hard to know if a given NP complete problem instance is "one of the hard ones" and to find such instances.
- chrisallenlane 9y agoThere's Gridcoin, which, if I understand correctly, is essentially the "coinification" of BOINC: http://www.gridcoin.us/ http://www.gridcoin.us/ It would be great if it ever became profitable to mine this.