compute merkle root from reduced list
This commit is contained in:
parent
5717b43661
commit
d57fec2659
|
@ -11,19 +11,19 @@ i = Interface({'server':'ecdsa.org:50002:s'})
|
||||||
i.start()
|
i.start()
|
||||||
|
|
||||||
|
|
||||||
def merkle_root(merkle):
|
encode = lambda x: x[::-1].encode('hex')
|
||||||
|
decode = lambda x: x.decode('hex')[::-1]
|
||||||
|
|
||||||
merkle = map (lambda tx_hash: tx_hash.decode('hex')[::-1], merkle)
|
|
||||||
while len(merkle) != 1:
|
|
||||||
if len(merkle)%2: merkle.append( merkle[-1] )
|
|
||||||
n = []
|
|
||||||
while merkle:
|
|
||||||
n.append( Hash( merkle[0] + merkle[1] ) )
|
|
||||||
merkle = merkle[2:]
|
|
||||||
|
|
||||||
merkle = n
|
def merkle_root(merkle_s, target_hash):
|
||||||
|
h = decode(target_hash)
|
||||||
return merkle[0][::-1].encode('hex')
|
for item in merkle_s:
|
||||||
|
is_left = item[0] == 'L'
|
||||||
|
if is_left:
|
||||||
|
h = Hash( h + decode(item[1:]) )
|
||||||
|
else:
|
||||||
|
h = Hash( decode(item[1:]) + h )
|
||||||
|
return encode(h)
|
||||||
|
|
||||||
|
|
||||||
def hash_header(res):
|
def hash_header(res):
|
||||||
|
@ -39,8 +39,7 @@ def hash_header(res):
|
||||||
def verify_tx(tx_hash):
|
def verify_tx(tx_hash):
|
||||||
|
|
||||||
res = i.synchronous_get([ ('blockchain.transaction.get_merkle',[tx_hash]) ])[0]
|
res = i.synchronous_get([ ('blockchain.transaction.get_merkle',[tx_hash]) ])[0]
|
||||||
assert tx_hash in res.get('merkle')
|
assert res.get('merkle_root') == merkle_root(res['merkle'], tx_hash)
|
||||||
assert res.get('merkle_root') == merkle_root(res['merkle'])
|
|
||||||
block_height = res.get('block_height')
|
block_height = res.get('block_height')
|
||||||
print block_height
|
print block_height
|
||||||
|
|
||||||
|
@ -58,7 +57,6 @@ def verify_tx(tx_hash):
|
||||||
assert header.get('merkle_root') == res.get('merkle_root')
|
assert header.get('merkle_root') == res.get('merkle_root')
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
try:
|
try:
|
||||||
tx = sys.argv[1]
|
tx = sys.argv[1]
|
||||||
except:
|
except:
|
||||||
|
|
Loading…
Reference in New Issue