from __future__ import division
-import struct
-import cStringIO as StringIO
import hashlib
-import warnings
+import struct
-from . import base58
-from p2pool.util import bases, expiring_dict, math
+from . import base58, skiplists
+from p2pool.util import bases, math, variable
+import p2pool
class EarlyEnd(Exception):
pass
raise EarlyEnd()
return data2, (data, pos + length)
+def size((data, pos)):
+ return len(data) - pos
+
class Type(object):
# the same data can have only one unpacked representation, but multiple packed binary representations
assert data2 is data
if pos != len(data):
- raise LateEnd('underread ' + repr((self, data)))
+ raise LateEnd()
return obj
+ def _pack(self, obj):
+ f = self.write(None, obj)
+
+ res = []
+ while f is not None:
+ res.append(f[1])
+ f = f[0]
+ res.reverse()
+ return ''.join(res)
+
+
def unpack(self, data):
obj = self._unpack(data)
- if __debug__:
+ if p2pool.DEBUG:
data2 = self._pack(obj)
if data2 != data:
- assert self._unpack(data2) == obj
+ if self._unpack(data2) != obj:
+ raise AssertionError()
return obj
- def _pack(self, obj):
- f = []
-
- self.write(f, obj)
-
- data = ''.join(f)
-
- return data
-
def pack(self, obj):
data = self._pack(obj)
- assert self._unpack(data) == obj
-
+ if p2pool.DEBUG:
+ if self._unpack(data) != obj:
+ raise AssertionError()
+
return data
def unpack_base58(self, base58_data):
return self.unpack(base58.base58_decode(base58_data))
-
+
def hash160(self, obj):
return ShortHashType().unpack(hashlib.new('ripemd160', hashlib.sha256(self.pack(obj)).digest()).digest())
def write(self, file, item):
if item < 0xfd:
- file.append(struct.pack('<B', item))
+ file = file, struct.pack('<B', item)
elif item <= 0xffff:
- file.append(struct.pack('<BH', 0xfd, item))
+ file = file, struct.pack('<BH', 0xfd, item)
elif item <= 0xffffffff:
- file.append(struct.pack('<BI', 0xfe, item))
+ file = file, struct.pack('<BI', 0xfe, item)
elif item <= 0xffffffffffffffff:
- file.append(struct.pack('<BQ', 0xff, item))
+ file = file, struct.pack('<BQ', 0xff, item)
else:
raise ValueError('int too large for varint')
+ return file
class VarStrType(Type):
_inner_size = VarIntType()
return read(file, length)
def write(self, file, item):
- self._inner_size.write(file, len(item))
- file.append(item)
+ return self._inner_size.write(file, len(item)), item
class FixedStrType(Type):
def __init__(self, length):
def write(self, file, item):
if len(item) != self.length:
- raise ValueError('incorrect length!')
- file.append(item)
+ raise ValueError('incorrect length item!')
+ return file, item
class EnumType(Type):
def __init__(self, inner, values):
return self.keys[data], file
def write(self, file, item):
- self.inner.write(file, self.values[item])
+ return self.inner.write(file, self.values[item])
class HashType(Type):
def read(self, file):
def write(self, file, item):
if not 0 <= item < 2**256:
- raise ValueError("invalid hash value")
+ raise ValueError('invalid hash value - %r' % (item,))
if item != 0 and item < 2**160:
- warnings.warn("very low hash value - maybe you meant to use ShortHashType? %x" % (item,))
- file.append(('%064x' % (item,)).decode('hex')[::-1])
+ print 'Very low hash value - maybe you meant to use ShortHashType? %x' % (item,)
+ return file, ('%064x' % (item,)).decode('hex')[::-1]
class ShortHashType(Type):
def read(self, file):
return int(data[::-1].encode('hex'), 16), file
def write(self, file, item):
- if item >= 2**160:
- raise ValueError("invalid hash value")
- file.append(('%040x' % (item,)).decode('hex')[::-1])
+ if not 0 <= item < 2**160:
+ raise ValueError('invalid hash value - %r' % (item,))
+ return file, ('%040x' % (item,)).decode('hex')[::-1]
class ListType(Type):
_inner_size = VarIntType()
return res, file
def write(self, file, item):
- self._inner_size.write(file, len(item))
+ file = self._inner_size.write(file, len(item))
for subitem in item:
- self.type.write(file, subitem)
-
-class FastLittleEndianUnsignedInteger(Type):
- def read(self, file):
- data, file = read(file, 4)
- data = map(ord, data)
- return data[0] + (data[1] << 8) + (data[2] << 16) + (data[3] << 24), file
-
- def write(self, file, item):
- StructType("<I").write(file, item)
+ file = self.type.write(file, subitem)
+ return file
class StructType(Type):
def __init__(self, desc):
data = struct.pack(self.desc, item)
if struct.unpack(self.desc, data)[0] != item:
# special test because struct doesn't error on some overflows
- raise ValueError("item didn't survive pack cycle (%r)" % (item,))
- file.append(data)
+ raise ValueError('''item didn't survive pack cycle (%r)''' % (item,))
+ return file, data
class IPV6AddressType(Type):
def read(self, file):
data, file = read(file, 16)
if data[:12] != '00000000000000000000ffff'.decode('hex'):
- raise ValueError("ipv6 addresses not supported yet")
+ raise ValueError('ipv6 addresses not supported yet')
return '.'.join(str(ord(x)) for x in data[12:]), file
def write(self, file, item):
bits = map(int, item.split('.'))
if len(bits) != 4:
- raise ValueError("invalid address: %r" % (bits,))
+ raise ValueError('invalid address: %r' % (bits,))
data = '00000000000000000000ffff'.decode('hex') + ''.join(chr(x) for x in bits)
assert len(data) == 16, len(data)
- file.append(data)
+ return file, data
+
+_record_types = {}
+
+def get_record(fields):
+ fields = tuple(sorted(fields))
+ if 'keys' in fields:
+ raise ValueError()
+ if fields not in _record_types:
+ class _Record(object):
+ __slots__ = fields
+ def __getitem__(self, key):
+ return getattr(self, key)
+ def __setitem__(self, key, value):
+ setattr(self, key, value)
+ #def __iter__(self):
+ # for field in self.__slots__:
+ # yield field, getattr(self, field)
+ def keys(self):
+ return self.__slots__
+ def __eq__(self, other):
+ if isinstance(other, dict):
+ return dict(self) == other
+ elif isinstance(other, _Record):
+ return all(self[k] == other[k] for k in self.keys())
+ raise TypeError()
+ def __ne__(self, other):
+ return not (self == other)
+ _record_types[fields] = _Record
+ return _record_types[fields]()
class ComposedType(Type):
def __init__(self, fields):
self.fields = fields
def read(self, file):
- item = {}
+ item = get_record(k for k, v in self.fields)
for key, type_ in self.fields:
item[key], file = type_.read(file)
return item, file
def write(self, file, item):
for key, type_ in self.fields:
- type_.write(file, item[key])
+ file = type_.write(file, item[key])
+ return file
class ChecksummedType(Type):
def __init__(self, inner):
obj, file = self.inner.read(file)
data = self.inner.pack(obj)
- if file.read(4) != hashlib.sha256(hashlib.sha256(data).digest()).digest()[:4]:
- raise ValueError("invalid checksum")
+ checksum, file = read(file, 4)
+ if checksum != hashlib.sha256(hashlib.sha256(data).digest()).digest()[:4]:
+ raise ValueError('invalid checksum')
return obj, file
def write(self, file, item):
data = self.inner.pack(item)
- file.append(data)
- file.append(hashlib.sha256(hashlib.sha256(data).digest()).digest()[:4])
+ return (file, data), hashlib.sha256(hashlib.sha256(data).digest()).digest()[:4]
class FloatingIntegerType(Type):
# redundancy doesn't matter here because bitcoin checks binary bits against its own computed bits
# so it will always be encoded 'normally' in blocks (they way bitcoin does it)
- _inner = StructType("<I")
- _inner = FastLittleEndianUnsignedInteger()
+ _inner = StructType('<I')
def read(self, file):
bits, file = self._inner.read(file)
target = self._bits_to_target(bits)
- if __debug__:
+ if p2pool.DEBUG:
if self._target_to_bits(target) != bits:
- raise ValueError("bits in non-canonical form")
+ raise ValueError('bits in non-canonical form')
return target, file
def write(self, file, item):
- self._inner.write(file, self._target_to_bits(item))
+ return self._inner.write(file, self._target_to_bits(item))
def truncate_to(self, x):
return self._bits_to_target(self._target_to_bits(x, _check=False))
-
+
def _bits_to_target(self, bits2):
target = math.shift_left(bits2 & 0x00ffffff, 8 * ((bits2 >> 24) - 3))
- assert target == self._bits_to_target1(struct.pack("<I", bits2))
- assert self._target_to_bits(target, _check=False) == bits2
+ if p2pool.DEBUG:
+ assert target == self._bits_to_target1(struct.pack('<I', bits2))
+ assert self._target_to_bits(target, _check=False) == bits2
return target
def _bits_to_target1(self, bits):
bits = bits[::-1]
length = ord(bits[0])
- return bases.string_to_natural((bits[1:] + "\0"*length)[:length])
-
+ return bases.string_to_natural((bits[1:] + '\0'*length)[:length])
+
def _target_to_bits(self, target, _check=True):
n = bases.natural_to_string(target)
if n and ord(n[0]) >= 128:
- n = "\x00" + n
+ n = '\x00' + n
bits2 = (chr(len(n)) + (n + 3*chr(0))[:3])[::-1]
- bits = struct.unpack("<I", bits2)[0]
+ bits = struct.unpack('<I', bits2)[0]
if _check:
if self._bits_to_target(bits) != target:
raise ValueError(repr((target, self._bits_to_target(bits, _check=False))))
def write(self, file, item):
if item == self.none_value:
- raise ValueError("none_value used")
- self.inner.write(file, self.none_value if item is None else item)
+ raise ValueError('none_value used')
+ return self.inner.write(file, self.none_value if item is None else item)
address_type = ComposedType([
('services', StructType('<Q')),
def target_to_average_attempts(target):
return 2**256//(target + 1)
+# tx
+
+def tx_get_sigop_count(tx):
+ return sum(script.get_sigop_count(txin['script']) for txin in tx['tx_ins']) + sum(script.get_sigop_count(txout['script']) for txout in tx['tx_outs'])
+
# human addresses
human_address_type = ChecksummedType(ComposedType([
- ('version', StructType("<B")),
+ ('version', StructType('<B')),
('pubkey_hash', ShortHashType()),
]))
raise ValueError('address not for this net!')
return x['pubkey_hash']
+# transactions
+
+def pubkey_to_script2(pubkey):
+ return ('\x41' + pubkey_type.pack(pubkey)) + '\xac'
+
+def pubkey_hash_to_script2(pubkey_hash):
+ return '\x76\xa9' + ('\x14' + ShortHashType().pack(pubkey_hash)) + '\x88\xac'
+
+def script2_to_human(script2, net):
+ try:
+ pubkey = script2[1:-1]
+ script2_test = pubkey_to_script2(pubkey)
+ except:
+ pass
+ else:
+ if script2_test == script2:
+ return 'Pubkey. Address: %s' % (pubkey_to_address(pubkey, net),)
+
+ try:
+ pubkey_hash = ShortHashType().unpack(script2[3:-2])
+ script2_test2 = pubkey_hash_to_script2(pubkey_hash)
+ except:
+ pass
+ else:
+ if script2_test2 == script2:
+ return 'Address. Address: %s' % (pubkey_hash_to_address(pubkey_hash, net),)
+
+ return 'Unknown. Script: %s' % (script2.encode('hex'),)
+
+# linked list tracker
+
+class Tracker(object):
+ def __init__(self):
+ self.shares = {} # hash -> share
+ #self.ids = {} # hash -> (id, height)
+ self.reverse_shares = {} # previous_hash -> set of share_hashes
+
+ self.heads = {} # head hash -> tail_hash
+ self.tails = {} # tail hash -> set of head hashes
+
+ self.heights = {} # share_hash -> height_to, other_share_hash
+
+ '''
+ self.id_generator = itertools.count()
+ self.tails_by_id = {}
+ '''
+
+ self.get_nth_parent_hash = skiplists.DistanceSkipList(self)
+
+ self.added = variable.Event()
+ self.removed = variable.Event()
+
+ def add(self, share):
+ assert not isinstance(share, (int, long, type(None)))
+ if share.hash in self.shares:
+ raise ValueError('share already present')
+
+ '''
+ parent_id = self.ids.get(share.previous_hash, None)
+ children_ids = set(self.ids.get(share2_hash) for share2_hash in self.reverse_shares.get(share.hash, set()))
+ infos = set()
+ if parent_id is not None:
+ infos.add((parent_id[0], parent_id[1] + 1))
+ for child_id in children_ids:
+ infos.add((child_id[0], child_id[1] - 1))
+ if not infos:
+ infos.add((self.id_generator.next(), 0))
+ chosen = min(infos)
+ self.ids[share.hash] = chosen
+ '''
+
+ self.shares[share.hash] = share
+ self.reverse_shares.setdefault(share.previous_hash, set()).add(share.hash)
+
+ if share.hash in self.tails:
+ heads = self.tails.pop(share.hash)
+ else:
+ heads = set([share.hash])
+
+ if share.previous_hash in self.heads:
+ tail = self.heads.pop(share.previous_hash)
+ else:
+ #dist, tail = self.get_height_and_last(share.previous_hash) # XXX this should be moved out of the critical area even though it shouldn't matter
+ tail = share.previous_hash
+ while tail in self.shares:
+ tail = self.shares[tail].previous_hash
+
+ self.tails.setdefault(tail, set()).update(heads)
+ if share.previous_hash in self.tails[tail]:
+ self.tails[tail].remove(share.previous_hash)
+
+ for head in heads:
+ self.heads[head] = tail
+
+ self.added.happened(share)
+
+ def test(self):
+ t = Tracker()
+ for s in self.shares.itervalues():
+ t.add(s)
+
+ assert self.shares == t.shares, (self.shares, t.shares)
+ assert self.reverse_shares == t.reverse_shares, (self.reverse_shares, t.reverse_shares)
+ assert self.heads == t.heads, (self.heads, t.heads)
+ assert self.tails == t.tails, (self.tails, t.tails)
+
+ def remove(self, share_hash):
+ assert isinstance(share_hash, (int, long, type(None)))
+ if share_hash not in self.shares:
+ raise KeyError()
+ share = self.shares[share_hash]
+ children = self.reverse_shares.get(share_hash, set())
+ del share_hash
+
+ if share.hash in self.heads and share.previous_hash in self.tails:
+ tail = self.heads.pop(share.hash)
+ self.tails[tail].remove(share.hash)
+ if not self.tails[share.previous_hash]:
+ self.tails.pop(share.previous_hash)
+ elif share.hash in self.heads:
+ tail = self.heads.pop(share.hash)
+ self.tails[tail].remove(share.hash)
+ if self.reverse_shares[share.previous_hash] != set([share.hash]):
+ pass # has sibling
+ else:
+ self.tails[tail].add(share.previous_hash)
+ self.heads[share.previous_hash] = tail
+ elif share.previous_hash in self.tails:
+ #raise NotImplementedError() # will break other things..
+ heads = self.tails[share.previous_hash]
+ if len(self.reverse_shares[share.previous_hash]) > 1:
+ raise NotImplementedError()
+ else:
+ del self.tails[share.previous_hash]
+ for head in heads:
+ self.heads[head] = share.hash
+ self.tails[share.hash] = set(heads)
+ else:
+ raise NotImplementedError()
+
+ to_remove = set()
+ for share_hash2 in self.heights:
+ height_to, other_share_hash, work_inc = self.heights[share_hash2]
+ if other_share_hash != share.previous_hash:
+ continue
+ assert children
+ if len(children) == 1:
+ height_to -= 1
+ other_share_hash = share.hash
+ work_inc -= target_to_average_attempts(share.target)
+ self.heights[share_hash2] = height_to, other_share_hash, work_inc
+ else:
+ to_remove.add(share_hash2)
+ for share_hash2 in to_remove:
+ del self.heights[share_hash2]
+ if share.hash in self.heights:
+ del self.heights[share.hash]
+
+ '''
+ height, tail = self.get_height_and_last(share.hash)
+
+ if share.hash in self.heads:
+ my_heads = set([share.hash])
+ elif share.previous_hash in self.tails:
+ my_heads = self.tails[share.previous_hash]
+ else:
+ some_heads = self.tails[tail]
+ some_heads_heights = dict((that_head, self.get_height_and_last(that_head)[0]) for that_head in some_heads)
+ my_heads = set(that_head for that_head in some_heads
+ if some_heads_heights[that_head] > height and
+ self.get_nth_parent_hash(that_head, some_heads_heights[that_head] - height) == share.hash)
+
+ if share.previous_hash != tail:
+ self.heads[share.previous_hash] = tail
+
+ for head in my_heads:
+ if head != share.hash:
+ self.heads[head] = share.hash
+ else:
+ self.heads.pop(head)
+
+ if share.hash in self.heads:
+ self.heads.pop(share.hash)
+
+
+ self.tails[tail].difference_update(my_heads)
+ if share.previous_hash != tail:
+ self.tails[tail].add(share.previous_hash)
+ if not self.tails[tail]:
+ self.tails.pop(tail)
+ if my_heads != set([share.hash]):
+ self.tails[share.hash] = set(my_heads) - set([share.hash])
+ '''
+
+ self.shares.pop(share.hash)
+ self.reverse_shares[share.previous_hash].remove(share.hash)
+ if not self.reverse_shares[share.previous_hash]:
+ self.reverse_shares.pop(share.previous_hash)
+
+ #assert self.test() is None
+ self.removed.happened(share)
+
+ def get_height(self, share_hash):
+ height, work, last = self.get_height_work_and_last(share_hash)
+ return height
+
+ def get_work(self, share_hash):
+ height, work, last = self.get_height_work_and_last(share_hash)
+ return work
+
+ def get_last(self, share_hash):
+ height, work, last = self.get_height_work_and_last(share_hash)
+ return last
+
+ def get_height_and_last(self, share_hash):
+ height, work, last = self.get_height_work_and_last(share_hash)
+ return height, last
+
+ def get_height_work_and_last(self, share_hash):
+ assert isinstance(share_hash, (int, long, type(None)))
+ orig = share_hash
+ height = 0
+ work = 0
+ updates = []
+ while True:
+ if share_hash is None or share_hash not in self.shares:
+ break
+ updates.append((share_hash, height, work))
+ if share_hash in self.heights:
+ height_inc, share_hash, work_inc = self.heights[share_hash]
+ else:
+ height_inc, share_hash, work_inc = 1, self.shares[share_hash].previous_hash, target_to_average_attempts(self.shares[share_hash].target)
+ height += height_inc
+ work += work_inc
+ for update_hash, height_then, work_then in updates:
+ self.heights[update_hash] = height - height_then, share_hash, work - work_then
+ return height, work, share_hash
+
+ def get_chain_known(self, start_hash):
+ assert isinstance(start_hash, (int, long, type(None)))
+ '''
+ Chain starting with item of hash I{start_hash} of items that this Tracker contains
+ '''
+ item_hash_to_get = start_hash
+ while True:
+ if item_hash_to_get not in self.shares:
+ break
+ share = self.shares[item_hash_to_get]
+ assert not isinstance(share, long)
+ yield share
+ item_hash_to_get = share.previous_hash
+
+ def get_chain_to_root(self, start_hash, root=None):
+ assert isinstance(start_hash, (int, long, type(None)))
+ assert isinstance(root, (int, long, type(None)))
+ '''
+ Chain of hashes starting with share_hash of shares to the root (doesn't include root)
+ Raises an error if one is missing
+ '''
+ share_hash_to_get = start_hash
+ while share_hash_to_get != root:
+ share = self.shares[share_hash_to_get]
+ yield share
+ share_hash_to_get = share.previous_hash
+
+ def get_best_hash(self):
+ '''
+ Returns hash of item with the most items in its chain
+ '''
+ if not self.heads:
+ return None
+ return max(self.heads, key=self.get_height_and_last)
+
+ def get_highest_height(self):
+ return max(self.get_height_and_last(head)[0] for head in self.heads) if self.heads else 0
+
+class FakeShare(object):
+ def __init__(self, **kwargs):
+ self.__dict__.update(kwargs)
+
+if __name__ == '__main__':
+
+ t = Tracker()
+
+ for i in xrange(10000):
+ t.add(FakeShare(hash=i, previous_hash=i - 1 if i > 0 else None))
+
+ #t.remove(99)
+
+ print 'HEADS', t.heads
+ print 'TAILS', t.tails
+
+ import random
+
+ while False:
+ print
+ print '-'*30
+ print
+ t = Tracker()
+ for i in xrange(random.randrange(100)):
+ x = random.choice(list(t.shares) + [None])
+ print i, '->', x
+ t.add(FakeShare(i, x))
+ while t.shares:
+ x = random.choice(list(t.shares))
+ print 'DEL', x, t.__dict__
+ try:
+ t.remove(x)
+ except NotImplementedError:
+ print 'aborted; not implemented'
+ import time
+ time.sleep(.1)
+ print 'HEADS', t.heads
+ print 'TAILS', t.tails
+
+ #for share_hash, share in sorted(t.shares.iteritems()):
+ # print share_hash, share.previous_hash, t.heads.get(share_hash), t.tails.get(share_hash)
+
+ #import sys;sys.exit()
+
+ print t.get_nth_parent_hash(9000, 5000)
+ print t.get_nth_parent_hash(9001, 412)
+ #print t.get_nth_parent_hash(90, 51)
+
+ for share_hash in sorted(t.shares):
+ print str(share_hash).rjust(4),
+ x = t.skips.get(share_hash, None)
+ if x is not None:
+ print str(x[0]).rjust(4),
+ for a in x[1]:
+ print str(a).rjust(10),
+ print
+
# network definitions
class Mainnet(object):
git://git.novaco.in / p2pool.git / blobdiff