Algorithm 3 Building the Merkle Tree and Currency Allocation

Require: 9 encoded user information and a minner ($u_1,u_2...u_9$ and miner) Ensure: Merkle tree and currency allocation   repeat    Continue to find new block;  until miner find the new block  $u_{10}\leftarrow miner$  for $i=1;i<=10;i++$ do    $H\left(u_i\right)\leftarrow SHA256(SHA256\left(Informatio{n}_{ui}\right)$   end for   for $i=1;i<=9;i+2$ do    $H(u_i,u_{i+1})\leftarrow SHA256(H\left(u_i\right),H\left(u_{i+1)}\right)$   end for   for $i=1;i<=9;i+4$ do    if $i<=8$ then     $H(u_i,u_{i+1},u_{i+2},u_{i+3})\leftarrow SHA256(H(u_i,u_{i+1}),H(u_{i+2},u_{i+3}))$    else     $H(u_i,u_{i+1})\leftarrow SHA256\left(SHA256\right(H\left(u_i\right),H\left(u_{i+1\left)\right)}\right)$    end if   end for   $H(u_1,u_2,u_3,u_4,u_5,u_6,u_7,u_8,u_9,u_{10})\leftarrow SHA256(H(u_1,u_2,u_3,u_4),H(u_5,u_6,u_7,u_8),H(u_9,u_{10}))$   if $H(u_1,u_2,u_3,u_4,u_5,u_6,u_7,u_8,u_9,u_{10})$ is legal then    $Reward\leftarrow 10$    for $j=1;j<=10;j++$ do     $Rewar{d}_{u_j}\leftarrow 1$    end for   else    Reassemble data;   end if