A Python 3 implementation of a Blockchain with a PBFT conscientious mechanism.
-
Updated
Apr 13, 2020 - Python
A Python 3 implementation of a Blockchain with a PBFT conscientious mechanism.
Implementation of Practical Byzantine Fault Tolerance (PBFT) consensus algorithm in Python
1. Implementation of PBFT in python. 2.Clustering the miners on the basis of distance. 3.Using ML to optimise the number of clusters to get the minimum number of commits
This is a modified version of PBFT consensus algorithm [1]. PBFT was designed as a method to solve the Byzantine General's Problem [2] in a distributed system. This method is designed to optimize the resource usage and reduce network latency.
Add a description, image, and links to the pbft topic page so that developers can more easily learn about it.
To associate your repository with the pbft topic, visit your repo's landing page and select "manage topics."