From: Forrest Voight <forrest@forre.st>
Date: Sun, 2 Dec 2012 17:53:54 +0000 (-0500)
Subject: instead of 300, request a random length of shares so that it always eventually gets... 
X-Git-Tag: 9.3^0
X-Git-Url: https://git.novaco.in/?p=p2pool.git;a=commitdiff_plain;h=f4a7b14a1314e0ada29b8a6d5fb9e2e52bb4dfe8

instead of 300, request a random length of shares so that it always eventually gets past a too-large chunk of the sharechain
---

diff --git a/p2pool/node.py b/p2pool/node.py
index f5bb93d..bb5041e 100644
--- 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],