mirror of
https://github.com/TheAlgorithms/Python.git
synced 2025-04-09 07:15:54 +00:00
Created proof_of_work.py
This commit is contained in:
parent
e14f6d5122
commit
374cbc2bf9
32
blockchain/proof_of_work.py
Normal file
32
blockchain/proof_of_work.py
Normal file
@ -0,0 +1,32 @@
|
|||||||
|
import hashlib
|
||||||
|
import time
|
||||||
|
|
||||||
|
def proof_of_work(difficulty: int) -> int:
|
||||||
|
"""
|
||||||
|
Simulates a Proof of Work mining process.
|
||||||
|
|
||||||
|
The miner must find a nonce such that the hash of the nonce starts
|
||||||
|
with a specific number of leading zeros (difficulty).
|
||||||
|
|
||||||
|
Args:
|
||||||
|
difficulty (int): The number of leading zeros required in the hash.
|
||||||
|
|
||||||
|
Returns:
|
||||||
|
int: The nonce value that solves the puzzle.
|
||||||
|
|
||||||
|
Example:
|
||||||
|
>>> result = proof_of_work(2) # Difficulty of 2 should be fast
|
||||||
|
>>> isinstance(result, int)
|
||||||
|
True
|
||||||
|
"""
|
||||||
|
prefix = '0' * difficulty
|
||||||
|
nonce = 0
|
||||||
|
start = time.time()
|
||||||
|
|
||||||
|
while True:
|
||||||
|
hash_result = hashlib.sha256(f"{nonce}".encode()).hexdigest()
|
||||||
|
if hash_result.startswith(prefix):
|
||||||
|
end = time.time()
|
||||||
|
print(f"Nonce: {nonce}, Hash: {hash_result}, Time: {end - start:.2f}s")
|
||||||
|
return nonce
|
||||||
|
nonce += 1
|
Loading…
x
Reference in New Issue
Block a user