cleaned up data.get_pool_attempts_per_second arguments
[p2pool.git] / p2pool / data.py
1 from __future__ import division
2
3 import itertools
4 import random
5 import time
6 import os
7
8 from twisted.python import log
9
10 import p2pool
11 from p2pool import skiplists
12 from p2pool.bitcoin import data as bitcoin_data, script
13 from p2pool.util import memoize, expiring_dict, math, forest
14
15
16 share_data_type = bitcoin_data.ComposedType([
17     ('previous_share_hash', bitcoin_data.PossiblyNoneType(0, bitcoin_data.HashType())),
18     ('coinbase', bitcoin_data.VarStrType()),
19     ('nonce', bitcoin_data.VarStrType()),
20     ('new_script', bitcoin_data.VarStrType()),
21     ('subsidy', bitcoin_data.StructType('<Q')),
22     ('donation', bitcoin_data.StructType('<H')),
23     ('stale_frac', bitcoin_data.StructType('<B')),
24 ])
25
26 share_info_type = bitcoin_data.ComposedType([
27     ('share_data', share_data_type),
28     ('target', bitcoin_data.FloatingIntegerType()),
29     ('timestamp', bitcoin_data.StructType('<I')),
30 ])
31
32 share1a_type = bitcoin_data.ComposedType([
33     ('header', bitcoin_data.block_header_type),
34     ('share_info', share_info_type),
35     ('merkle_branch', bitcoin_data.merkle_branch_type),
36 ])
37
38 share1b_type = bitcoin_data.ComposedType([
39     ('header', bitcoin_data.block_header_type),
40     ('share_info', share_info_type),
41     ('other_txs', bitcoin_data.ListType(bitcoin_data.tx_type)),
42 ])
43
44 # type:
45 # 0: share1a
46 # 1: share1b
47
48 share_type = bitcoin_data.ComposedType([
49     ('type', bitcoin_data.VarIntType()),
50     ('contents', bitcoin_data.VarStrType()),
51 ])
52
53 class Share(object):
54     __slots__ = 'header previous_block share_info merkle_branch other_txs timestamp share_data new_script subsidy previous_hash previous_share_hash target nonce pow_hash header_hash hash time_seen peer donation stale_frac'.split(' ')
55     
56     @classmethod
57     def from_share(cls, share, net):
58         if share['type'] == 0:
59             res = cls.from_share1a(share1a_type.unpack(share['contents']), net)
60             if not (res.pow_hash > res.header['target']):
61                 raise ValueError('invalid share type')
62             return res
63         elif share['type'] == 1:
64             res = cls.from_share1b(share1b_type.unpack(share['contents']), net)
65             if not (res.pow_hash <= res.header['target']):
66                 raise ValueError('invalid share type')
67             return res
68         else:
69             raise ValueError('unknown share type: %r' % (share['type'],))
70     
71     @classmethod
72     def from_share1a(cls, share1a, net):
73         return cls(net, **share1a)
74     
75     @classmethod
76     def from_share1b(cls, share1b, net):
77         return cls(net, **share1b)
78     
79     def __init__(self, net, header, share_info, merkle_branch=None, other_txs=None):
80         if merkle_branch is None and other_txs is None:
81             raise ValueError('need either merkle_branch or other_txs')
82         if other_txs is not None:
83             new_merkle_branch = bitcoin_data.calculate_merkle_branch([dict(version=0, tx_ins=[], tx_outs=[], lock_time=0)] + other_txs, 0)
84             if merkle_branch is not None:
85                 if merke_branch != new_merkle_branch:
86                     raise ValueError('invalid merkle_branch and other_txs')
87             merkle_branch = new_merkle_branch
88         
89         if len(merkle_branch) > 16:
90             raise ValueError('merkle_branch too long!')
91         
92         self.header = header
93         self.previous_block = header['previous_block']
94         self.share_info = share_info
95         self.merkle_branch = merkle_branch
96         self.other_txs = other_txs
97         
98         self.share_data = self.share_info['share_data']
99         self.target = self.share_info['target']
100         self.timestamp = self.share_info['timestamp']
101         
102         self.new_script = self.share_data['new_script']
103         self.subsidy = self.share_data['subsidy']
104         self.donation = self.share_data['donation']
105         
106         if len(self.new_script) > 100:
107             raise ValueError('new_script too long!')
108         
109         self.previous_hash = self.previous_share_hash = self.share_data['previous_share_hash']
110         self.nonce = self.share_data['nonce']
111         
112         if len(self.nonce) > 100:
113             raise ValueError('nonce too long!')
114         
115         if len(self.share_data['coinbase']) > 100:
116             raise ValueError('''coinbase too large! %i bytes''' % (len(self.share_data['coinbase']),))
117         
118         self.pow_hash = net.BITCOIN_POW_FUNC(header)
119         self.header_hash = bitcoin_data.block_header_type.hash256(header)
120         
121         self.hash = share1a_type.hash256(self.as_share1a())
122         
123         if self.pow_hash > self.target:
124             print 'hash %x' % self.pow_hash
125             print 'targ %x' % self.target
126             raise ValueError('not enough work!')
127         
128         if script.get_sigop_count(self.new_script) > 1:
129             raise ValueError('too many sigops!')
130         
131         self.stale_frac = self.share_data['stale_frac']/254 if self.share_data['stale_frac'] != 255 else None
132         
133         # XXX eww
134         self.time_seen = time.time()
135         self.peer = None
136     
137     def __repr__(self):
138         return '<Share %s>' % (' '.join('%s=%r' % (k, getattr(self, k)) for k in self.__slots__),)
139     
140     def check(self, tracker, now, net):
141         share_info, gentx = generate_transaction(tracker, self.share_info['share_data'], self.header['target'], self.share_info['timestamp'], net)
142         if share_info != self.share_info:
143             raise ValueError('share difficulty invalid')
144         
145         if bitcoin_data.check_merkle_branch(gentx, 0, self.merkle_branch) != self.header['merkle_root']:
146             raise ValueError('''gentx doesn't match header via merkle_branch''')
147     
148     def as_share(self):
149         if self.pow_hash > self.header['target']: # share1a
150             return dict(type=0, contents=share1a_type.pack(self.as_share1a()))
151         elif self.pow_hash <= self.header['target']: # share1b
152             return dict(type=1, contents=share1b_type.pack(self.as_share1b()))
153         else:
154             raise AssertionError()
155     
156     def as_share1a(self):
157         return dict(header=self.header, share_info=self.share_info, merkle_branch=self.merkle_branch)
158     
159     def as_share1b(self):
160         if self.other_txs is None:
161             raise ValueError('share does not contain all txs')
162         
163         return dict(header=self.header, share_info=self.share_info, other_txs=self.other_txs)
164     
165     def as_block(self, tracker, net):
166         if self.other_txs is None:
167             raise ValueError('share does not contain all txs')
168         
169         share_info, gentx = generate_transaction(tracker, self.share_info['share_data'], self.header['target'], self.share_info['timestamp'], net)
170         assert share_info == self.share_info
171         
172         return dict(header=self.header, txs=[gentx] + self.other_txs)
173
174 def get_pool_attempts_per_second(tracker, previous_share_hash, dist):
175     near = tracker.shares[previous_share_hash]
176     far = tracker.shares[tracker.get_nth_parent_hash(previous_share_hash, dist - 1)]
177     attempts = tracker.get_work(near.hash) - tracker.get_work(far.hash)
178     time = near.timestamp - far.timestamp
179     if time == 0:
180         time = 1
181     return attempts//time
182
183 def generate_transaction(tracker, share_data, block_target, desired_timestamp, net):
184     previous_share_hash = share_data['previous_share_hash']
185     new_script = share_data['new_script']
186     subsidy = share_data['subsidy']
187     donation = share_data['donation']
188     assert 0 <= donation <= 65535
189     
190     if len(share_data['coinbase']) > 100:
191         raise ValueError('coinbase too long!')
192     
193     previous_share = tracker.shares[previous_share_hash] if previous_share_hash is not None else None
194     
195     height, last = tracker.get_height_and_last(previous_share_hash)
196     assert height >= net.CHAIN_LENGTH or last is None
197     if height < net.TARGET_LOOKBEHIND:
198         target = bitcoin_data.FloatingInteger.from_target_upper_bound(net.MAX_TARGET)
199     else:
200         attempts_per_second = get_pool_attempts_per_second(tracker, previous_share_hash, net.TARGET_LOOKBEHIND)
201         pre_target = 2**256//(net.SHARE_PERIOD*attempts_per_second) - 1
202         pre_target2 = math.clip(pre_target, (previous_share.target*9//10, previous_share.target*11//10))
203         pre_target3 = math.clip(pre_target2, (0, net.MAX_TARGET))
204         target = bitcoin_data.FloatingInteger.from_target_upper_bound(pre_target3)
205     
206     attempts_to_block = bitcoin_data.target_to_average_attempts(block_target)
207     max_att = net.SPREAD * attempts_to_block
208     
209     this_att = min(bitcoin_data.target_to_average_attempts(target), max_att)
210     other_weights, other_total_weight, other_donation_weight = tracker.get_cumulative_weights(previous_share_hash, min(height, net.CHAIN_LENGTH), 65535*max(0, max_att - this_att))
211     assert other_total_weight == sum(other_weights.itervalues()) + other_donation_weight, (other_total_weight, sum(other_weights.itervalues()) + other_donation_weight)
212     weights, total_weight, donation_weight = math.add_dicts([{new_script: this_att*(65535-donation)}, other_weights]), this_att*65535 + other_total_weight, this_att*donation + other_donation_weight
213     assert total_weight == sum(weights.itervalues()) + donation_weight, (total_weight, sum(weights.itervalues()) + donation_weight)
214     
215     SCRIPT = '4104ffd03de44a6e11b9917f3a29f9443283d9871c9d743ef30d5eddcd37094b64d1b3d8090496b53256786bf5c82932ec23c3b74d9f05a6f95a8b5529352656664bac'.decode('hex')
216     
217     # 1 satoshi is always donated so that a list of p2pool generated blocks can be easily found by looking at the donation address
218     amounts = dict((script, (subsidy-1)*(199*weight)//(200*total_weight)) for (script, weight) in weights.iteritems())
219     amounts[new_script] = amounts.get(new_script, 0) + (subsidy-1)//200
220     amounts[SCRIPT] = amounts.get(SCRIPT, 0) + (subsidy-1)*(199*donation_weight)//(200*total_weight)
221     amounts[SCRIPT] = amounts.get(SCRIPT, 0) + subsidy - sum(amounts.itervalues()) # collect any extra satoshis :P
222     
223     if sum(amounts.itervalues()) != subsidy:
224         raise ValueError()
225     if any(x < 0 for x in amounts.itervalues()):
226         raise ValueError()
227     
228     dests = sorted(amounts.iterkeys(), key=lambda script: (amounts[script], script))
229     dests = dests[-4000:] # block length limit, unlikely to ever be hit
230     
231     share_info = dict(
232         share_data=share_data,
233         target=target,
234         timestamp=math.clip(desired_timestamp, (previous_share.timestamp - 60, previous_share.timestamp + 60)) if previous_share is not None else desired_timestamp,
235     )
236     
237     return share_info, dict(
238         version=1,
239         tx_ins=[dict(
240             previous_output=None,
241             sequence=None,
242             script=share_data['coinbase'].ljust(2, '\x00'),
243         )],
244         tx_outs=[dict(value=0, script='\x20' + bitcoin_data.HashType().pack(share_info_type.hash256(share_info)))] + [dict(value=amounts[script], script=script) for script in dests if amounts[script]],
245         lock_time=0,
246     )
247
248
249 class OkayTracker(forest.Tracker):
250     def __init__(self, net):
251         forest.Tracker.__init__(self)
252         self.net = net
253         self.verified = forest.Tracker()
254         self.verified.get_nth_parent_hash = self.get_nth_parent_hash # self is a superset of self.verified
255         
256         self.get_cumulative_weights = skiplists.WeightsSkipList(self)
257     
258     def add(self, share, known_verified=False):
259         forest.Tracker.add(self, share)
260         if known_verified:
261             self.verified.add(share)
262     
263     def attempt_verify(self, share, now):
264         if share.hash in self.verified.shares:
265             return True
266         height, last = self.get_height_and_last(share.hash)
267         if height < self.net.CHAIN_LENGTH + 1 and last is not None:
268             raise AssertionError()
269         try:
270             share.check(self, now, self.net)
271         except:
272             log.err(None, 'Share check failed:')
273             return False
274         else:
275             self.verified.add(share)
276             return True
277     
278     def think(self, ht, previous_block, now):
279         desired = set()
280         
281         # O(len(self.heads))
282         #   make 'unverified heads' set?
283         # for each overall head, attempt verification
284         # if it fails, attempt on parent, and repeat
285         # if no successful verification because of lack of parents, request parent
286         bads = set()
287         for head in set(self.heads) - set(self.verified.heads):
288             head_height, last = self.get_height_and_last(head)
289             
290             for share in itertools.islice(self.get_chain_known(head), None if last is None else min(5, max(0, head_height - self.net.CHAIN_LENGTH))):
291                 if self.attempt_verify(share, now):
292                     break
293                 if share.hash in self.heads:
294                     bads.add(share.hash)
295             else:
296                 if last is not None:
297                     desired.add((self.shares[random.choice(list(self.reverse_shares[last]))].peer, last))
298         for bad in bads:
299             assert bad not in self.verified.shares
300             assert bad in self.heads
301             if p2pool.DEBUG:
302                 print "BAD", bad
303             self.remove(bad)
304         
305         # try to get at least CHAIN_LENGTH height for each verified head, requesting parents if needed
306         for head in list(self.verified.heads):
307             head_height, last_hash = self.verified.get_height_and_last(head)
308             last_height, last_last_hash = self.get_height_and_last(last_hash)
309             # XXX review boundary conditions
310             want = max(self.net.CHAIN_LENGTH - head_height, 0)
311             can = max(last_height - 1 - self.net.CHAIN_LENGTH, 0) if last_last_hash is not None else last_height
312             get = min(want, can)
313             #print 'Z', head_height, last_hash is None, last_height, last_last_hash is None, want, can, get
314             for share in itertools.islice(self.get_chain_known(last_hash), get):
315                 if not self.attempt_verify(share, now):
316                     break
317             if head_height < self.net.CHAIN_LENGTH and last_last_hash is not None:
318                 desired.add((self.verified.shares[random.choice(list(self.verified.reverse_shares[last_hash]))].peer, last_last_hash))
319         
320         # decide best tree
321         best_tail = max(self.verified.tails, key=lambda h: self.score(max(self.verified.tails[h], key=self.verified.get_height), ht)) if self.verified.tails else None
322         # decide best verified head
323         scores = sorted(self.verified.tails.get(best_tail, []), key=lambda h: (
324             self.verified.get_work(self.verified.get_nth_parent_hash(h, min(5, self.verified.get_height(h)))),
325             #self.verified.shares[h].peer is None,
326             ht.get_min_height(self.verified.shares[h].previous_block),
327             -self.verified.shares[h].time_seen
328         ))
329         
330         
331         if p2pool.DEBUG:
332             print len(self.verified.tails), "chain tails and", len(self.verified.tails.get(best_tail, [])), 'chain heads. Top 10 heads:'
333             if len(scores) > 10:
334                 print '    ...'
335             for h in scores[-10:]:
336                 print '   ', format_hash(h), format_hash(self.verified.shares[h].previous_hash), (
337                     self.verified.get_work(self.verified.get_nth_parent_hash(h, min(5, self.verified.get_height(h)))),
338                     self.verified.shares[h].peer is None,
339                     ht.get_min_height(self.verified.shares[h].previous_block),
340                     -self.verified.shares[h].time_seen
341                 )
342         
343         # eat away at heads
344         if scores:
345             for i in xrange(1000):
346                 to_remove = set()
347                 for share_hash, tail in self.heads.iteritems():
348                     if share_hash in scores[-5:]:
349                         #print 1
350                         continue
351                     if self.shares[share_hash].time_seen > time.time() - 300:
352                         #print 2
353                         continue
354                     if share_hash not in self.verified.shares and max(self.shares[after_tail_hash].time_seen for after_tail_hash in self.reverse_shares.get(tail)) > time.time() - 120: # XXX stupid
355                         #print 3
356                         continue
357                     to_remove.add(share_hash)
358                 if not to_remove:
359                     break
360                 for share_hash in to_remove:
361                     self.remove(share_hash)
362                     if share_hash in self.verified.shares:
363                         self.verified.remove(share_hash)
364                 #print "_________", to_remove
365         
366         # drop tails
367         for i in xrange(1000):
368             to_remove = set()
369             for tail, heads in self.tails.iteritems():
370                 if min(self.get_height(head) for head in heads) < 2*self.net.CHAIN_LENGTH + 10:
371                     continue
372                 for aftertail in self.reverse_shares.get(tail, set()):
373                     if len(self.reverse_shares[self.shares[aftertail].previous_hash]) > 1: # XXX
374                         print "raw"
375                         continue
376                     to_remove.add(aftertail)
377             if not to_remove:
378                 break
379             # if removed from this, it must be removed from verified
380             #start = time.time()
381             for aftertail in to_remove:
382                 if self.shares[aftertail].previous_hash not in self.tails:
383                     print "erk", aftertail, self.shares[aftertail].previous_hash
384                     continue
385                 self.remove(aftertail)
386                 if aftertail in self.verified.shares:
387                     self.verified.remove(aftertail)
388             #end = time.time()
389             #print "removed! %i %f" % (len(to_remove), (end - start)/len(to_remove))
390         
391         best = scores[-1] if scores else None
392         
393         if best is not None:
394             best_share = self.verified.shares[best]
395             if ht.get_min_height(best_share.header['previous_block']) < ht.get_min_height(previous_block) and best_share.header_hash != previous_block and best_share.peer is not None:
396                 if p2pool.DEBUG:
397                     print 'Stale detected! %x < %x' % (best_share.header['previous_block'], previous_block)
398                 best = best_share.previous_hash
399         
400         return best, desired
401     
402     @memoize.memoize_with_backing(expiring_dict.ExpiringDict(5, get_touches=False))
403     def score(self, share_hash, ht):
404         head_height, last = self.verified.get_height_and_last(share_hash)
405         score2 = 0
406         attempts = 0
407         max_height = 0
408         share2_hash = self.verified.get_nth_parent_hash(share_hash, min(self.net.CHAIN_LENGTH//2, head_height//2)) if last is not None else share_hash
409         for share in reversed(list(itertools.islice(self.verified.get_chain_known(share2_hash), self.net.CHAIN_LENGTH))):
410             max_height = max(max_height, ht.get_min_height(share.header['previous_block']))
411             attempts += bitcoin_data.target_to_average_attempts(share.target)
412             this_score = attempts//(ht.get_highest_height() - max_height + 1)
413             if this_score > score2:
414                 score2 = this_score
415         return min(head_height, self.net.CHAIN_LENGTH), score2
416
417 def format_hash(x):
418     if x is None:
419         return 'xxxxxxxx'
420     return '%08x' % (x % 2**32)
421
422 class ShareStore(object):
423     def __init__(self, prefix, net):
424         self.filename = prefix
425         self.dirname = os.path.dirname(os.path.abspath(prefix))
426         self.filename = os.path.basename(os.path.abspath(prefix))
427         self.net = net
428         self.known = None # will be filename -> set of share hashes, set of verified hashes
429     
430     def get_shares(self):
431         if self.known is not None:
432             raise AssertionError()
433         known = {}
434         filenames, next = self.get_filenames_and_next()
435         for filename in filenames:
436             share_hashes, verified_hashes = known.setdefault(filename, (set(), set()))
437             with open(filename, 'rb') as f:
438                 for line in f:
439                     try:
440                         type_id_str, data_hex = line.strip().split(' ')
441                         type_id = int(type_id_str)
442                         if type_id == 0:
443                             pass
444                         elif type_id == 1:
445                             pass
446                         elif type_id == 2:
447                             verified_hash = int(data_hex, 16)
448                             yield 'verified_hash', verified_hash
449                             verified_hashes.add(verified_hash)
450                         elif type_id == 5:
451                             share = Share.from_share(share_type.unpack(data_hex.decode('hex')), self.net)
452                             yield 'share', share
453                             share_hashes.add(share.hash)
454                         else:
455                             raise NotImplementedError("share type %i" % (type_id,))
456                     except Exception:
457                         log.err(None, "Error while reading saved shares, continuing where left off:")
458         self.known = known
459     
460     def _add_line(self, line):
461         filenames, next = self.get_filenames_and_next()
462         if filenames and os.path.getsize(filenames[-1]) < 10e6:
463             filename = filenames[-1]
464         else:
465             filename = next
466         
467         with open(filename, 'ab') as f:
468             f.write(line + '\n')
469         
470         return filename
471     
472     def add_share(self, share):
473         type_id, data = 5, share_type.pack(share.as_share())
474         filename = self._add_line("%i %s" % (type_id, data.encode('hex')))
475         share_hashes, verified_hashes = self.known.setdefault(filename, (set(), set()))
476         share_hashes.add(share.hash)
477     
478     def add_verified_hash(self, share_hash):
479         filename = self._add_line("%i %x" % (2, share_hash))
480         share_hashes, verified_hashes = self.known.setdefault(filename, (set(), set()))
481         verified_hashes.add(share_hash)
482     
483     def get_filenames_and_next(self):
484         suffixes = sorted(int(x[len(self.filename):]) for x in os.listdir(self.dirname) if x.startswith(self.filename) and x[len(self.filename):].isdigit())
485         return [os.path.join(self.dirname, self.filename + str(suffix)) for suffix in suffixes], os.path.join(self.dirname, self.filename + (str(suffixes[-1] + 1) if suffixes else str(0)))
486     
487     def forget_share(self, share_hash):
488         for filename, (share_hashes, verified_hashes) in self.known.iteritems():
489             if share_hash in share_hashes:
490                 share_hashes.remove(share_hash)
491         self.check_remove()
492     
493     def forget_verified_share(self, share_hash):
494         for filename, (share_hashes, verified_hashes) in self.known.iteritems():
495             if share_hash in verified_hashes:
496                 verified_hashes.remove(share_hash)
497         self.check_remove()
498     
499     def check_remove(self):
500         to_remove = set()
501         for filename, (share_hashes, verified_hashes) in self.known.iteritems():
502             #print filename, len(share_hashes) + len(verified_hashes)
503             if not share_hashes and not verified_hashes:
504                 to_remove.add(filename)
505         for filename in to_remove:
506             self.known.pop(filename)
507             os.remove(filename)
508             print "REMOVED", filename