Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
This tag should be used for questions regarding the function and use of proof-of-work systems and proof-of-work algorithms. Proof of work describes a decentralized consensus system based on an arbitrary mathematical problem that is moderately hard to solve but easy to verify.
2
votes
Proof of work for standard computers
I designed Cuckoo Cycle at https://github.com/tromp/cuckoo as the first trivially verifiable, scalable and time-memory-trade-off-hard proof-of-work system. It parallellizes reasonably well up to at le …
2
votes
Is there an "additive" proof-of-work?
Your property of what I would call "improvable" is actually considered undesirable for PoWs. It would allow a prover to make continuous progress
toward a solution that satisfies the difficulty thresho …
8
votes
Memory-hard proof-of-work: are they ASIC-resistant?
What prevents an attacker from building a custom ASIC and buying off-the-shelf DRAM chips, and building systems that pair each ASIC with a DRAM chip?
DRAM memory is already pretty optimized for r …