forked from jimmysong/programmingbitcoin
-
Notifications
You must be signed in to change notification settings - Fork 0
/
answers.py
188 lines (149 loc) · 4.07 KB
/
answers.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
'''
# tag::answer5[]
>>> import math
>>> total = 27
>>> max_depth = math.ceil(math.log(total, 2))
>>> merkle_tree = []
>>> for depth in range(max_depth + 1):
... num_items = math.ceil(total / 2**(max_depth - depth))
... level_hashes = [None] * num_items
... merkle_tree.append(level_hashes)
>>> for level in merkle_tree:
... print(level)
[None]
[None, None]
[None, None, None, None]
[None, None, None, None, None, None, None]
[None, None, None, None, None, None, None, None, None, None, None, None, None,\
None]
[None, None, None, None, None, None, None, None, None, None, None, None, None,\
None, None, None, None, None, None, None, None, None, None, None, None, None,\
None]
# end::answer5[]
'''
from unittest import TestCase
import helper
import merkleblock
from block import Block
from helper import (
bytes_to_bit_field,
hash256,
little_endian_to_int,
read_varint,
)
from merkleblock import (
MerkleBlock,
MerkleTree,
)
'''
# tag::exercise1[]
==== Exercise 1
Write the `merkle_parent` function.
# end::exercise1[]
'''
# tag::answer1[]
def merkle_parent(hash1, hash2):
'''Takes the binary hashes and calculates the hash256'''
return hash256(hash1 + hash2)
# end::answer1[]
'''
# tag::exercise2[]
==== Exercise 2
Write the `merkle_parent_level` function.
# end::exercise2[]
'''
# tag::answer2[]
def merkle_parent_level(hashes):
'''Takes a list of binary hashes and returns a list that's half
the length'''
if len(hashes) == 1:
raise RuntimeError('Cannot take a parent level with only 1 item')
if len(hashes) % 2 == 1:
hashes.append(hashes[-1])
parent_level = []
for i in range(0, len(hashes), 2):
parent = merkle_parent(hashes[i], hashes[i + 1])
parent_level.append(parent)
return parent_level
# end::answer2[]
'''
# tag::exercise3[]
==== Exercise 3
Write the `merkle_root` function.
# end::exercise3[]
'''
# tag::answer3[]
def merkle_root(hashes):
'''Takes a list of binary hashes and returns the merkle root
'''
current_level = hashes
while len(current_level) > 1:
current_level = merkle_parent_level(current_level)
return current_level[0]
# end::answer3[]
'''
# tag::exercise4[]
==== Exercise 4
Write the `validate_merkle_root` method for `Block`.
# end::exercise4[]
'''
# tag::answer4[]
def validate_merkle_root(self):
hashes = [h[::-1] for h in self.tx_hashes]
root = merkle_root(hashes)
return root[::-1] == self.merkle_root
# end::answer4[]
'''
# tag::exercise5[]
==== Exercise 5
Create an empty Merkle Tree with 27 items and print each level.
# end::exercise5[]
'''
'''
# tag::exercise6[]
==== Exercise 6
Write the `parse` method for `MerkleBlock`.
# end::exercise6[]
'''
# tag::answer6[]
@classmethod
def parse(cls, s):
version = little_endian_to_int(s.read(4))
prev_block = s.read(32)[::-1]
merkle_root = s.read(32)[::-1]
timestamp = little_endian_to_int(s.read(4))
bits = s.read(4)
nonce = s.read(4)
total = little_endian_to_int(s.read(4))
num_hashes = read_varint(s)
hashes = []
for _ in range(num_hashes):
hashes.append(s.read(32)[::-1])
flags_length = read_varint(s)
flags = s.read(flags_length)
return cls(version, prev_block, merkle_root, timestamp, bits,
nonce, total, hashes, flags)
# end::answer6[]
'''
# tag::exercise7[]
==== Exercise 7
Write the `is_valid` method for `MerkleBlock`.
# end::exercise7[]
'''
# tag::answer7[]
def is_valid(self):
flag_bits = bytes_to_bit_field(self.flags)
hashes = [h[::-1] for h in self.hashes]
merkle_tree = MerkleTree(self.total)
merkle_tree.populate_tree(flag_bits, hashes)
return merkle_tree.root()[::-1] == self.merkle_root
# end::answer7[]
class ChapterTest(TestCase):
def test_apply(self):
helper.merkle_parent = merkle_parent
merkleblock.merkle_parent = merkle_parent
helper.merkle_parent_level = merkle_parent_level
helper.merkle_root = merkle_root
Block.validate_merkle_root = validate_merkle_root
MerkleBlock.parse = parse
MerkleBlock.is_valid = is_valid