git://git.novaco.in
/
p2pool.git
/ commitdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
| commitdiff |
tree
raw
|
patch
(parent:
216839e
)
instead of 300, request a random length of shares so that it always eventually gets...
9.3
author
Forrest Voight
<forrest@forre.st>
Sun, 2 Dec 2012 17:53:54 +0000 (12:53 -0500)
committer
Forrest Voight
<forrest@forre.st>
Sun, 2 Dec 2012 17:54:28 +0000 (12:54 -0500)
p2pool/node.py
patch
|
blob
|
history
diff --git
a/p2pool/node.py
b/p2pool/node.py
index
f5bb93d
..
bb5041e
100644
(file)
--- a/
p2pool/node.py
+++ b/
p2pool/node.py
@@
-110,7
+110,7
@@
class P2PNode(p2p.Node):
try:
shares = yield peer.get_shares(
hashes=[share_hash],
- parents=300-1,
+ parents=random.randrange(500), # randomize parents so that we eventually get past a too large block of shares
stops=list(set(self.node.tracker.heads) | set(
self.node.tracker.get_nth_parent_hash(head, min(max(0, self.node.tracker.get_height_and_last(head)[0] - 1), 10)) for head in self.node.tracker.heads
))[:100],