The Byzantine Generals Problem (1982) [pdf]
lamport.azurewebsites.net
The Byzantine Generals Problem (1982) [pdf]
1–10 of 22 posts
Re: The Byzantine Generals Problem (1982) [pdf]
#2The PBFT algorithm, or any Byzantine fault tolerant algorithms are deliberate on what's the message-passing scheme and election protocol would look like.
However, in recent ICO craze, a lot of algorithms (with the exception of Bitcoin, and maybe others I didn't read) don't go very long way other than "we will broadcast to everyone". These under-specified message passing scheme can be troublesome, especially for these algorithms without Proof-of-work.
Re: The Byzantine Generals Problem (1982) [pdf]
#3The PBFT algorithm, or any Byzantine fault tolerant algorithms are deliberate on what's the message-passing scheme and election protocol would look like. However, in recent ICO craze, a lot of algorithms (with the exception of Bitcoin, and maybe others I didn't read) don't go very long way other than "we will broadcast to everyone". These under-specified message passing scheme can be troublesome, especially for these…
Which protocols have you read?
Re: The Byzantine Generals Problem (1982) [pdf]
#4I have a professor who is interested in the Byzantine Generals Problem and worked with Lamport at Microsoft Research. She claimed that Leslie told her that no one was interested in the problem/it didn't matter. Here[1] is a clever algorithm for leader election that she presented to us.
Re: The Byzantine Generals Problem (1982) [pdf]
#5The PBFT algorithm, or any Byzantine fault tolerant algorithms are deliberate on what's the message-passing scheme and election protocol would look like. However, in recent ICO craze, a lot of algorithms (with the exception of Bitcoin, and maybe others I didn't read) don't go very long way other than "we will broadcast to everyone". These under-specified message passing scheme can be troublesome, especially for these…
Which protocols have you read?
Will try not to reply here since it can be inflammatory (any cryptocurrency topic here HN). That's been said, can you find any mention of "messages" in this article: https://steemit.com/dpos/@dantheman/dpos-consensus-algorithm... which directly referenced as their DPoS algorithm here: https://github.com/EOSIO/Documentation/blob/master/Technical... (I am not saying these are wrong, just under-specified scheme will essentially become implementation-specified and doesn't help anyone here).
Re: The Byzantine Generals Problem (1982) [pdf]
#6Discussed in 2014: https://news.ycombinator.com/item?id=8697029
Re: The Byzantine Generals Problem (1982) [pdf]
#7The PBFT algorithm, or any Byzantine fault tolerant algorithms are deliberate on what's the message-passing scheme and election protocol would look like. However, in recent ICO craze, a lot of algorithms (with the exception of Bitcoin, and maybe others I didn't read) don't go very long way other than "we will broadcast to everyone". These under-specified message passing scheme can be troublesome, especially for these…
Check out Hashgraph. It is asynchronous Byzantine.
Re: The Byzantine Generals Problem (1982) [pdf]
#8James Mickens wrote an interesting and very funny essay on this problem: https://scholar.harvard.edu/files/mickens/files/thesaddestmo...
Re: The Byzantine Generals Problem (1982) [pdf]
#9James Mickens wrote an interesting and very funny essay on this problem: https://scholar.harvard.edu/files/mickens/files/thesaddestmo...
It doesn't matter what the topic is, anything James Mickens has to say on it will be entertaining.
They are as scrutable as Solomonic proverbs, and just as bloodthirsty, but at the end of the day I feel like I read something that maybe made me a better programmer.
Re: The Byzantine Generals Problem (1982) [pdf]
#10In networking, Radia Perlman had some decent research done on this: http://www.vendian.org/mncharity/dir3/perlman_thesis/
In my opinion,that is what routing protocols should look like. Or at least they should adopt byzantine fault tolerance and modern crypto to authenticate route updates.