• Uses the nonce to hash the block
• Converts the hash to base 10
• Needs to find a number less than X (i.e 0.0000000000000001 → Dificulty limit)
  • which might have a hex representation like 0x0000000000000000000000afbbaaaaaaa
  • The dificulty limit vary depending on how much it's taking to be solved → Block Time
• Needs to spread the solution to the other nodes
• The majority of nodes needs to validate the solution