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 | |
Results tagged with difficulty
Search options not deleted
user 62320
This tag should be used for questions regarding difficulty which encodes the likelihood of one hash to succeed at mining a block. Indirectly, it is a measure of the total hashing power of all miners for a given cryptocurrency.
1
vote
2
answers
1k
views
How is the "N" in PPLNS chosen? 2xDiff appears to make no sense - OR - Why are Scrypt share ...
Let's say BitConnect's difficulty is currently ~900,000. … And the pool software counts a share with difficulty X the same as X shares with difficulty 1. …
- 83
0
votes
Accepted
How is the "N" in PPLNS chosen? 2xDiff appears to make no sense - OR - Why are Scrypt share ...
with difficulty N is counted the same way as N shares with difficulty 1 (or N/2 shares with difficulty 2*N, etc.) - that's the pool difficulty
This also means that with an N=2*coindiff in PPLNS, like … "average time = difficulty * 2^32 / hashrate", and that on average you need 2^32 hashes to find a difficulty-one share, etc. …
- 83