Do all consensus algorithms aim to solve the Byzantine generals problem?

Do all consensus algorithms aim to solve the Byzantine generals problem?

Can I clarify my understanding:

Byzantine Fault Tolerance is a characteristic of a system to tolerate a class of failures belonging to the byzantine generals problem.

Byzantine Fault tolerance is also the name of the consensus algorithm that solves the byzantine generals problem?

I see Ripple as being BFT. Does it mean it uses some custom algorithm, that solves BFT?

I also see Stellar uses BFT, does this mean that Stellar and Ripple Both use different algorithms that solve BFT?

Edit:

Can all Proof of Insert word algorithms be seen to be a part of BFT? Because POW uses a probabilistic model to solve the generals problem, but it is not seen as BFT.

https://ift.tt/2pRWHim

Comments

Post a Comment

Popular posts from this blog

What exactly is a block?

What exactly is a block? I am trying to understand the Blockchain algorithm used in Bitcoin. I do not get the part how blocks are created. Let’s say transactions occur at some time. Then, if some nodes get these transactions, these verify the transactions are valid and then send it to other nodes. With this verify-send algorithm, almost every node verifies these newly occurred transactions in few seconds. Now, it is a time for a miner to do his job, which I do not understand. He needs to find a nonce which makes a lower value than hash values given in transactions. Question 1 How many transactions should a miner should verify in a single block? For example, if a miner A finds a nonce which gives a lower value than hash values given in 50 transactions, and if a miner B finds a nonce which gives a lower value than hash values given in 70 transacations, would a reward be given only to the miner B? So should a miner appropriately choose how many transacations he will work for? Ques...
Read more

Firmware With Unlocked Overclock for Bitmain Antminer Z9 Equihash ASIC Miners

Image
Firmware With Unlocked Overclock for Bitmain Antminer Z9 Equihash ASIC Miners It seems that just like with the newer Antminer Z9 Mini the new faster Antminer Z9 Equihash ASIC miners from Bitmain are arriving with locked overclock functionality in the firmware. We already know that these ASIC miners are overclocking pretty well and you can easily get a nice performance boost over the stock hashrate the devices come with, so why is Bitmain limiting you… it is pretty clear, they want you to buy more units. Fortunately there are alternatives that allow you to overclock your Antminer Z9 miners and get a nice extra performance boost. Initially there was only a modified firmware released by user efudd on Bitcointalk that was sold to interested people, but now there is also a free version of a modified firmware available with unlocked frequencies by smartass111. Of course you are more than welcome to make a donation to the author of the modified firmware in order to support and motivate him....
Read more

How to use this nodejs script (by:Raghav Sood) that have been posted on the stackexchange

How to use this nodejs script (by:Raghav Sood) that have been posted on the stackexchange I'm new to javascript I'm trying to use this script from this post (made by Raghav Sood) : Bruteforce bitcoin address - I know the words + public address but not the order var bip39 = require('bip39'); var bitcoin = require('bitcoinjs-lib') var lineReader = require('readline').createInterface({ input: require('fs').createReadStream('addresses.txt') }); var ctr = 1; lineReader.on('line', function (line) { if (ctr%100 == 0) { console.log("Processing #" + ctr); } if (bip39.validateMnemonic(line)) { var roothex = bip39.mnemonicToSeedHex(line); var rootnode = bitcoin.HDNode.fromSeedHex(roothex); var basechild = rootnode.deriveHardened(49) .deriveHardened(0) .deriveHardened(0) .derive(0); for (var i = 0; i < 3; i++) { v...
Read more