Distributed systems are networks of nodes depending on each other. However, each network can have multiple faulty nodes, which are either malfunctioning or malicious. Bracha's algorithm allows correct nodes inside the network to agree on certain information, while tolerating a certain amount of faulty nodes. Nodes exchange Send, Echo and Ready message types to inform each other of receiving the message and agreeing on its trustworthiness. The focus of this paper is to present the functional differences of exchanging message paths that messages have crossed instead of the message types. In conclusion, the BMP algorithm showed potential to outperform original Bracha's algorithm in two general cases: networks that have a low probability of successfully transmitting a message, and networks where nodes have a system of trust established which allows them to determine trustworthiness of other nodes. Otherwise, in general usage, original Bracha's algorithms appears to be superior in comparison to the BMP algorithm.