Python/blockchain/proof_of_work.py

33 lines
930 B
Python
Raw Normal View History

2024-10-10 16:44:01 +00:00
import hashlib
import time
def proof_of_work(difficulty: int) -> int:
"""
Simulates a Proof of Work mining process.
2024-10-10 16:50:05 +00:00
The miner must find a nonce such that the hash of the nonce starts
with a specific number of leading zeros (difficulty).
Args:
2024-10-10 16:50:05 +00:00
difficulty (int): The number of leading zeros required in the hash.
Returns:
2024-10-10 16:50:05 +00:00
int: The nonce value that solves the puzzle.
Example:
2024-10-10 16:50:05 +00:00
>>> result = proof_of_work(2) # Difficulty of 2 should be fast
>>> isinstance(result, int)
True
"""
2024-10-10 16:50:05 +00:00
prefix = '0' * difficulty
nonce = 0
start = time.time() # Timing starts
2024-10-10 16:44:01 +00:00
while True:
hash_result = hashlib.sha256(f"{nonce}".encode()).hexdigest()
if hash_result.startswith(prefix):
end = time.time() # Timing ends
print(f"Time taken: {end - start:.2f}s") # Print time taken
return nonce
nonce += 1