Demonstration of highly simplified Puzzle for Proof of Work consensus model

➜ python3 main.py
Difficulty = 0 Time = 0:00:00.000013 Nounce = 1 Hash = 03b2d25f63b362774da2851d236a16c70be47cc6e8927b69125f2ee2296c8b45
Difficulty = 00 Time = 0:00:00.000835 Nounce = 480 Hash = 009c0415979b7bc349fbb835482e41b121c0b4721d2e0747c4b788151c347f31
Difficulty = 000 Time = 0:00:00.011603 Nounce = 5789 Hash = 000cd4e392985c6e721672c4f1d97e68b524c73f9ed93e11da539c992f44d6f9
Difficulty = 0000 Time = 0:00:00.019559 Nounce = 11647 Hash = 0000c5d2099dfc8e88c2434c4f06191d1d1ca3c9a7131f933782d87c534d7ca1
Difficulty = 00000 Time = 0:00:02.501971 Nounce = 1430567 Hash = 00000c702fad183cb14ae88f60d110e6ea48f13c6af2213c46902fe80377d08d

As the difficulty increases, the time taken for finding nounce for new block hash increases too.