2 ms·

Given the Two Generals problem, I wanted to frame "eventual consistency" as the below, (but it doesn't work): Alice sends a message saying "Attack on XX:XX on

Given the Two Generals problem, I wanted to frame "eventual consistency" as the below, (but it doesn't work): Alice sends a message saying "Attack on XX:XX on the nth day", and sends that message each day, with nth changing to (n - days)th. If the network (Eve) is lossy, it means she doesn't automatically burn all messages, so eventually, Bob will receive Alice's message. Bob then responds with the same message back to Alice, until Alice receives it. I initially thought this would work, but the extra round-trip from Bob to Alice makes it a problem. I suppose with a long enough 'n', one only needs 2 round-trips, but with a state beyond {0;1}, it's probably impossible to reach "eventual consistency"

zzzcpan 8y ago
Reaching consensus is the definition of strong consistency. Eventual consistency would be something like: "Alice: I don't care when Bob attacks, as long as he attacks sometime in the future."
- nevi-me 8y ago
  Someone pointed out that the 2 generals problem wasn't stated correctly on the post, the Wikipedia article invalidates my thinking entirely [0]. So, I agree re. strong consistency; as the problem was about that, and not eventual consistency. https://en.m.wikipedia.org/wiki/Two_Generals'_Problem https://en.m.wikipedia.org/wiki/Two_Generals'_Problem