4 from p2pool.util import forest, math
5 from p2pool.bitcoin import data as bitcoin_data
7 class DumbTracker(object):
8 def __init__(self, shares=[]):
9 self.shares = {} # hash -> share
10 self.reverse_shares = {} # previous_hash -> set of share_hashes
16 if share.hash in self.shares:
17 raise ValueError('share already present')
18 self.shares[share.hash] = share
19 self.reverse_shares.setdefault(share.previous_hash, set()).add(share.hash)
21 def remove(self, share_hash):
22 share = self.shares[share_hash]
25 self.shares.pop(share.hash)
26 self.reverse_shares[share.previous_hash].remove(share.hash)
27 if not self.reverse_shares[share.previous_hash]:
28 self.reverse_shares.pop(share.previous_hash)
32 return dict((x, self.get_last(x)) for x in self.shares if x not in self.reverse_shares)
36 return dict((x, set(y for y in self.shares if self.get_last(y) == x and y not in self.reverse_shares)) for x in self.reverse_shares if x not in self.shares)
38 def get_height(self, share_hash):
39 height, work, last = self.get_height_work_and_last(share_hash)
42 def get_work(self, share_hash):
43 height, work, last = self.get_height_work_and_last(share_hash)
46 def get_last(self, share_hash):
47 height, work, last = self.get_height_work_and_last(share_hash)
50 def get_height_and_last(self, share_hash):
51 height, work, last = self.get_height_work_and_last(share_hash)
54 def get_nth_parent_hash(self, share_hash, n):
56 share_hash = self.shares[share_hash].previous_hash
59 def get_height_work_and_last(self, share_hash):
62 while share_hash in self.shares:
63 share_hash, work_inc = self.shares[share_hash].previous_hash, bitcoin_data.target_to_average_attempts(self.shares[share_hash].target)
66 return height, work, share_hash
68 def is_child_of(self, share_hash, possible_child_hash):
69 if self.get_last(share_hash) != self.get_last(possible_child_hash):
72 if possible_child_hash == share_hash:
74 if possible_child_hash not in self.shares:
76 possible_child_hash = self.shares[possible_child_hash].previous_hash
78 class FakeShare(object):
80 def __init__(self, **kwargs):
81 for k, v in kwargs.iteritems():
86 return 'FakeShare(' + ', '.join('%s=%r' % (k, v) for k, v in self._attrs.iteritems()) + ')'
88 def test_tracker(self):
89 t = DumbTracker(self.shares.itervalues())
91 assert self.shares == t.shares, (self.shares, t.shares)
92 assert self.reverse_shares == t.reverse_shares, (self.reverse_shares, t.reverse_shares)
93 assert self.heads == t.heads, (self.heads, t.heads)
94 assert self.tails == t.tails, (self.tails, t.tails)
96 for start in self.shares:
97 a, b = self.get_height_work_and_last(start), t.get_height_work_and_last(start)
100 other = random.choice(self.shares.keys())
101 assert self.is_child_of(start, other) == t.is_child_of(start, other)
102 assert self.is_child_of(other, start) == t.is_child_of(other, start)
104 def generate_tracker_simple(n):
105 t = forest.Tracker(math.shuffled(FakeShare(hash=i, previous_hash=i - 1 if i > 0 else None) for i in xrange(n)))
109 def generate_tracker_random(n):
112 x = random.choice(shares + [FakeShare(hash=None), FakeShare(hash=random.randrange(1000000, 2000000))]).hash
113 shares.append(FakeShare(hash=i, previous_hash=x))
114 t = forest.Tracker(math.shuffled(shares))
118 class Test(unittest.TestCase):
119 def test_tracker(self):
120 t = generate_tracker_simple(1000)
122 assert t.heads == {999: None}
123 assert t.tails == {None: set([999])}
125 assert t.get_nth_parent_hash(900, 500) == 900 - 500
126 assert t.get_nth_parent_hash(901, 42) == 901 - 42
128 def test_get_nth_parent_hash(self):
129 t = generate_tracker_simple(200)
131 for i in xrange(1000):
132 a = random.randrange(200)
133 b = random.randrange(a + 1)
134 res = t.get_nth_parent_hash(a, b)
135 assert res == a - b, (a, b, res)
137 def test_tracker2(self):
138 for ii in xrange(50):
139 t = generate_tracker_random(random.randrange(100))
142 x = random.choice(list(t.shares))
145 except NotImplementedError:
146 pass # print "aborted", x