Timeline for Is there a proof of work system which takes significantly more memory to generate than it does to verify?
Current License: CC BY-SA 3.0
14 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 14, 2015 at 20:00 | history | bounty ended | Nick ODell | ||
| Apr 12, 2015 at 15:21 | comment | added | CodesInChaos | Wouldn't a a simple cycle-finding or distinguished point based collision search reduce the memory cost of momentum a lot while increasing computational cost only by a small factor? | |
| Apr 8, 2015 at 22:03 | comment | added | Nick ODell | @StephenM347 All three have different problems 1) Someone could insert random looking data 2) Someone could run multiple miners in parallel on the same data set, 3) Has the problems you noted. They're all good tries at the problem, but they fall flat for one reason or another. | |
| Apr 8, 2015 at 20:05 | comment | added | morsecoder | @NickODell, my answer has shown 3 different ways of doing this, do these not meet your requirements? | |
| Apr 7, 2015 at 17:55 | comment | added | morsecoder | @NickODell, the ziftrCOIN algorithm also uses an algorithm that requires more memory to calculate than it does to verify, through using the merkle tree right in the block as the merkle tree I described in my answer. The advantage is you can prove knowledge of all of the data you are mining while only requiring one of the transactions to prove a header is valid to an SPV node. | |
| Mar 28, 2015 at 20:45 | comment | added | Jannes | @NickODell because local RAM is always faster than external RAM and ASIC is always faster than CPU? That's the whole point. There is no point in making PoW CPU/GPU resistant because if it's worth it, someone will make an ASIC for it. Because an ASIC is basically just a CPU+RAM with all the unnecessary (general purpose) stuff cut out. To make it faster. In the end you're burning Watts... that's the whole point. Absolute speed doesn't matter (same Watts) but speed relative to others matters! If you need to be rich to invest in an ASIC plant you get an unfair advantage -> centralization. | |
| Mar 28, 2015 at 16:57 | comment | added | Nick ODell | @Jannes If you're building an ASIC with 137 GB of RAM, why not make the RAM external, so you can get it for less? And if the algorithm largely depends on RAM, why not replace the ASIC with a CPU? | |
| Mar 28, 2015 at 12:39 | comment | added | Jannes | Using the blockchain for data at least sort of forces miners to be a full node, that's at least some advantage I guess. Using 137GB of random data means you're just waiting for someone to build an ASIC with 137GB RAM and everyone else is screwed (so much for resistance...). | |
| Mar 28, 2015 at 7:03 | history | edited | morsecoder | CC BY-SA 3.0 |
added 734 characters in body
|
| Mar 28, 2015 at 7:01 | comment | added | morsecoder | @NickODell, thanks. I've edited my post, you may be interested in the Momentum algorithm as well. | |
| Mar 28, 2015 at 6:55 | history | edited | morsecoder | CC BY-SA 3.0 |
added 117 characters in body
|
| Mar 28, 2015 at 6:38 | history | edited | morsecoder | CC BY-SA 3.0 |
added 226 characters in body
|
| Mar 28, 2015 at 6:29 | comment | added | Nick ODell | If the mining was based on data in the block chain, someone could insert data that appeared random, but was actually highly compressable if you knew some secret key. The second approach seems sound, though. | |
| Mar 28, 2015 at 6:24 | history | answered | morsecoder | CC BY-SA 3.0 |