Timeline for Lamport's Byzantine Generals Algorithm
Current License: CC BY-SA 3.0
14 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 9, 2014 at 11:41 | answer | added | mattrix | timeline score: 2 | |
| Mar 9, 2014 at 10:04 | comment | added | mattrix | Thankyou for checking. To be honest I had enough trouble working out the algorithm from that paper, and haven't gone through the proofs. | |
| Mar 9, 2014 at 8:09 | comment | added | hengxin | I have checked your example but found noting wrong. Here is my current opinion: your understanding is not wrong; it is not done yet. The specification (correctness) of IC1 is that "All loyal lieutenants obey the same order". $1,0,0,X,1,1$ seems not good for lieutenant $b$. BUT, it does not matter. Any other loyal lieutenant will get the same vector of $1,0,0,X,1,1$ (see the last paragraph of the proof of Theorem 1). That is to say, $X$ will be the same for all loyal lieutenants and the agreement is still satisfied. Please check another loyal lieutenant besides $b$ and let me know. | |
| Mar 9, 2014 at 6:25 | comment | added | mattrix | @hengxin I've cleaned the question so hopefully it is a bit clearer. EIG is basically what I'm doing, except (1) I'm using a table instead of a tree (2) I 'prepend' at the send stage instead of 'appending' at the receive stage. I'm assuming all messages sent and received. My problems are I'm not sure I've got the algorithm correct. And the value I get at the end doesn't seem useful. | |
| S Mar 9, 2014 at 4:58 | history | suggested | alvonellos | CC BY-SA 3.0 |
Spelling edits
|
| Mar 9, 2014 at 3:44 | review | Suggested edits | |||
| S Mar 9, 2014 at 4:58 | |||||
| Mar 9, 2014 at 3:00 | history | edited | mattrix | CC BY-SA 3.0 |
deleted 2 characters in body
|
| Mar 9, 2014 at 2:44 | history | edited | mattrix | CC BY-SA 3.0 |
hopefully made it clearer.
|
| Mar 8, 2014 at 12:17 | comment | added | hengxin | A more comprehensible explanation of synchronous Byzantine General problem can be found in James Aspnes, Yale, CS465 Course notes. I find it easier to understand this algorithm by "unfolding" its recursion in term of "Exponential Information Gathering" (EIG) and then proving its correctness recursively. | |
| Mar 7, 2014 at 13:53 | comment | added | hengxin | In your example, which lieutenant is the traitor and which lieutenant are you considering? | |
| Mar 6, 2014 at 22:39 | history | tweeted | twitter.com/#!/StackCompSci/status/441704560231727104 | ||
| Mar 6, 2014 at 17:26 | comment | added | vzn | interestingly/related, this "byzantines generals" is the same problem "solved" by the bitcoin protocol.... note there may be some expertise on this on Cryptography or Bitcoin | |
| Mar 6, 2014 at 13:02 | review | First posts | |||
| Mar 6, 2014 at 17:58 | |||||
| Mar 6, 2014 at 12:44 | history | asked | mattrix | CC BY-SA 3.0 |