import hashlib
x = 11
y = 1
#這里可以調(diào)節(jié)挖礦難度，也就是哈希的長度
while hashlib.sha256(f'{x*y}'.encode("utf-8")).hexdigest()[5:7]!="00":
  print(x*y)
  y +=1
print("找到了：",(x*y))

#挖礦原理與網(wǎng)絡(luò)共識
import datetime
import hashlib
import json
import requests

class Blockchain2:

  def __init__(self):
    self.chain = [] #區(qū)塊鏈列表
    self.nodes = set() #節(jié)點(diǎn)集合
    self.current_tranactions = [] #交易列表
    self.new_block(proof=100,preHash=1) #創(chuàng)建第一個區(qū)塊

  #新建一個區(qū)塊，需要計(jì)算，才能追加
  def new_block(self,proof,preHash = None):
    block={
      "index":len(self.chain)+1,#區(qū)塊索引
      "timestamp":datetime.datetiem.now(),#區(qū)塊時間戳
      "transactions":self.current_tranactions,#區(qū)塊交易記錄集合
      "proof":proof,#算力憑證
      "preHash":preHash or self.hash(self.chain[-1]), #上一塊的哈希
    }
    self.current_tranactions = [] #開辟新的區(qū)塊，初始化區(qū)塊交易記錄
    self.chain.append(block)

  @staticmethod
  def hash(block):
    #處理為json字符串格式的哈希
    block_str = json.dumps(block,sort_keys=True).encode("utf-8")
    return hashlib.sha256(block_str).hexdigest()

  #新增交易記錄
  def new_transaction(self,sender,receiver,amount):
    transaction ={
      "sender":sender,
      "receiver":receiver,
      "amount":amount,
    }

    self.current_tranactions.append(transaction)

    return self.last_block["index"]+1

  @property
  def last_block(self):
    return self.chain[-1]

  #挖礦，依賴上一個模塊，獲取工作量證明，即POW共識機(jī)制
  def proof_of_work(self,last_block):
    last_proof = last_block["proof"]
    last_hash = self.hash(last_block)
    proof = 0

    while self.valid_proof(last_proof,proof,last_hash) is False:
      proof +=1

    return proof

  #校驗(yàn)工作量
  @staticmethod
  def valid_proof(last_proof,proof,last_hash):
    guess = f'{last_proof}{proof}{last_hash}'.encode("utf-8")
    guess_hash = hashlib.sha256(guess).hexdigest()
    return guess_hash[:6] =="000000" #可以調(diào)整計(jì)算難度

  #區(qū)塊一致性，同步算法,
  def resolve_conflicts(self):
    neighbours = self.nodes
    new_chain = None
    max_length = len(self.chain)
    #遍歷所有節(jié)點(diǎn)，找出最長的鏈
    for node in neighbours:
      #獲取節(jié)點(diǎn)區(qū)塊鏈信息
      response = requests.get(f'http://{node}/chain')
      if response.status_code ==200:
        length = response.json()["length"]
        chain = response.json()["chain"]

        if length>max_length and self.valid_chain(chain):
          max_length = length
          new_chain = chain

    if new_chain:
      self.chain = new_chain
      return True
    else:
      return False

  #校驗(yàn)區(qū)塊鏈的合法性
  def valid_chain(self,chain):
    last_block = chain[0]
    current_index = 1
    #校驗(yàn)每一個區(qū)塊的prehash,proof合法性
    while current_index <len(chain):
      block = chain[current_index]
      #校驗(yàn)哈希的合法性
      if block["preHash"] != self.hash(last_block):
        return False
      #校驗(yàn)算力的合法性
      if not self.valid_proof(last_block["proof"],block["proof"],block["preHash"]):
        return False
      last_block = block
      current_index +=1
    return True