블록

from io import BytesIO from unittest import TestCase from helper import ( bits_to_target, hash256, int_to_little_endian, little_endian_to_int, merkle_root, ) GENESIS_BLOCK = bytes.fromhex('0100000000000000000000000000000000000000000000000000000000000000000000003ba3edfd7a7b12b27ac72c3e67768f617fc81bc3888a51323a9fb8aa4b1e5e4a29ab5f49ffff001d1dac2b7c') TESTNET_GENESIS_BLOCK = bytes.fromhex('0100000000000000000000000000000000000000000000000000000000000000000000003ba3edfd7a7b12b27ac72c3e67768f617fc81bc3888a51323a9fb8aa4b1e5e4adae5494dffff001d1aa4ae18') LOWEST_BITS = bytes.fromhex('ffff001d') class Block: def __init__(self, version, prev_block, merkle_root, timestamp, bits, nonce, tx_hashes=None): self.version = version self.prev_block = prev_block self.merkle_root = merkle_root self.timestamp = timestamp self.bits = bits self.nonce = nonce self.tx_hashes = tx_hashes @classmethod def parse(cls, s): #버전 4바이트 version = little_endian_to_int(s.read(4)) #이전블록 32바이트, 리틀엔디언으로 전환 prev_block = s.read(32)[::-1] #머클루트 32바이트, 리틀엔디언으로 전환 merkle_root = s.read(32)[::-1] #타임스탬프 timestamp = little_endian_to_int(s.read(4)) #난이도 bits = s.read(4) #논스 nonce = s.read(4) return cls(version, prev_block, merkle_root, timestamp, bits, nonce) def serialize(self): result = int_to_little_endian(self.version, 4) result += self.prev_block[::-1] result += self.merkle_root[::-1] result += int_to_little_endian(self.timestamp, 4) result += self.bits result += self.nonce return result def hash(self): s = self.serialize() h256 = hash256(s) return h256[::-1] #BIP0009의 버전 표현. 가장 앞 비트가 '001'이다. def bip9(self): return self.version >> 29 == 0b001 def bip91(self): return self.version >> 4 & 1 == 1 def bip141(self): return self.version >> 1 & 1 == 1 #머클루트 검증 def validate_merkle_root(self): hashes = [h[::-1] for h in self.tx_hashes] root = merkle_root(hashes)[::-1] return root == self.merkle_root

import math from io import BytesIO from unittest import TestCase from helper import ( bytes_to_bit_field, little_endian_to_int, merkle_parent, read_varint, ) class MerkleTree: def __init__(self, total): self.total = total #머클트리의 깊이를 먼저 구한다. self.max_depth = math.ceil(math.log(self.total, 2)) self.nodes = [] #깊이를 하나씩 들어간다. for depth in range(self.max_depth + 1): #이번 깊이의 노드 인덱스 num_items = math.ceil(self.total / 2**(self.max_depth - depth)) #트리 초기화 level_hashes = [None] * num_items self.nodes.append(level_hashes) #포인터 self.current_depth = 0 self.current_index = 0 def __repr__(self): result = [] for depth, level in enumerate(self.nodes): items = [] for index, h in enumerate(level): if h is None: short = 'None' else: short = '{}...'.format(h.hex()[:8]) if depth == self.current_depth and index == self.current_index: items.append('*{}*'.format(short[:-2])) else: items.append('{}'.format(short)) result.append(', '.join(items)) return '\n'.join(result) def up(self): #깊이를 하나 더 들어감. self.current_depth -= 1 self.current_index //= 2 def left(self): #왼쪽 자식 탐색 self.current_depth += 1 self.current_index *= 2 def right(self): #오른쪽 자식 탐색 self.current_depth += 1 self.current_index = self.current_index * 2 + 1 def root(self): return self.nodes[0][0] def set_current_node(self, value): self.nodes[self.current_depth][self.current_index] = value def get_current_node(self): return self.nodes[self.current_depth][self.current_index] def get_left_node(self): return self.nodes[self.current_depth + 1][self.current_index * 2] def get_right_node(self): return self.nodes[self.current_depth + 1][self.current_index * 2 + 1] def is_leaf(self): return self.current_depth == self.max_depth #현재 특정 깊이의 가장 우측 노드이고 자식이 홀수인 경우 오른쪽은 존재하지 않는다. 존재하면 True. def right_exists(self): return len(self.nodes[self.current_depth + 1]) > self.current_index * 2 + 1 #머클 트리 만들기 def populate_tree(self): #현재의 포인트가 루트일때 까지 반복한다. while self.root() is None: #단말 노드인 경우 if self.is_leaf(): self.up() else: #왼쪽 값을 가져온다. left_hash = self.get_left_node() #만약 값이 없으면, 왼쪽을 계산하기 위해 이동한다. if left_hash is None: tree.left() #오른쪽 자식이 존재하는 경우 elif self.right_exists(): #값을 가져온다. right_hash = self.get_right_node() #없으면, 이동한다. if right_hash is None: self.right() #있다면 else: #왼쪽자식과 오른쪽 자식을 정의한다. self.set_current_node(merkle_parent(left_hash, right_hash)) #한 단계 깊이 들어간다. self.up() #만약 오른쪽 자식이 없다면 else: #왼쪽 자식을 두 번 정의한다. self.set_current_node(merkle_parent(left_hash, left_hash)) self.up() hex_hashes = [ "9745f7173ef14ee4155722d1cbf13304339fd00d900b759c6f9d58579b5765fb", "5573c8ede34936c29cdfdfe743f7f5fdfbd4f54ba0705259e62f39917065cb9b", "82a02ecbb6623b4274dfcab82b336dc017a27136e08521091e443e62582e8f05", "507ccae5ed9b340363a0e6d765af148be9cb1c8766ccc922f83e4ae681658308", "a7a4aec28e7162e1e9ef33dfa30f0bc0526e6cf4b11a576f6c5de58593898330", "bb6267664bd833fd9fc82582853ab144fece26b7a8a5bf328f8a059445b59add", "ea6d7ac1ee77fbacee58fc717b990c4fcccf1b19af43103c090f601677fd8836", "457743861de496c429912558a106b810b0507975a49773228aa788df40730d41", "7688029288efc9e9a0011c960a6ed9e5466581abf3e3a6c26ee317461add619a", "b1ae7f15836cb2286cdd4e2c37bf9bb7da0a2846d06867a429f654b2e7f383c9", "9b74f89fa3f93e71ff2c241f32945d877281a6a50a6bf94adac002980aafe5ab", "b3a92b5b255019bdaf754875633c2de9fec2ab03e6b8ce669d07cb5b18804638", "b5c0b915312b9bdaedd2b86aa2d0f8feffc73a2d37668fd9010179261e25e263", "c9d52c5cb1e557b92c84c52e7c4bfbce859408bedffc8a5560fd6e35e10b8800", "c555bc5fc3bc096df0a0c9532f07640bfb76bfe4fc1ace214b8b228a1297a4c2", ] tree = MerkleTree(len(hex_hashes)) hashes = [bytes.fromhex(h) for h in hex_hashes] tree.nodes[4]= [bytes.fromhex(h) for h in hex_hashes] tree.populate_tree() print(tree) #------ 결과 ------ dc87b7e3... 6382df3f..., 6440941e... 3ba6c080..., 8e894862..., 7ab01bb6..., 996be980... 272945ec..., 9a38d037..., 4a64abd9..., ec7c95e1..., 3b67006c..., 850683df..., d40d268b..., f542a085... 9745f717..., 5573c8ed..., 82a02ecb..., 507ccae5..., a7a4aec2..., bb626766..., ea6d7ac1..., 45774386..., 76880292..., b1ae7f15..., 9b74f89f..., b3a92b5b..., b5c0b915..., c9d52c5c..., c555bc5f...