News for hackers. Stuff that matters.
Re:Two Generals and Time Machines by FrozenVoid on Sunday July 15, 2018 @12:13PM (#17535815)
Could this be solved by sending lots of messages to synchronize between the two parties. Even if most messages are lost, its possible to have a state where you have both the same goal: if both receive the same message they sent they're on the same page.

   A sends "Attack?Send your plan"
   B sends "Retreat,Send your plan"
   A sends "Retreat,Send your plan"
   B sends "Retreat,Send your plan"
   A sends "Retreat,Send your plan"
   B sends "Retreat,Send your plan"
Re:Two Generals and Time Machines by zzzcpan on Sunday July 15, 2018 @01:19PM (#17536099)
It's possible to have a state where both reach consensus, but not possible to guarantee such state to happen in bounded time.

Here's another example: Alice asks Bob to attack in the morning. Bob accepts. But Eve doesn't let Bob's acceptance message to get to Alice. Alice waits for some time and asks Bob again to attack in the morning. Bob accepts. But message still doesn't reach Alice. If message does reach Alice before the attack, it's a win. If not, i.e. Eve holds messages past the attack time, only Bob attacks, as Alice won't know if he will.

Re:Two Generals and Time Machines by FrozenVoid on Sunday July 15, 2018 @01:34PM (#17536153)
Synchronization can involve any data.

   A sends "Attack at 5:00, send your plan"
   B sends "Attack at 5:00, send your plan"
   A sends "Attack at 5:00, send your plan"
   B sends "Attack at 5:00, send your plan"
   A sends "Attack at 5:00, send your plan"
   B sends "Attack at 5:00, send your plan"
Repeat until you got 3-4 confirmations of same data being sent back to you and the plan will work.
Re:Two Generals and Time Machines by mdonahoe on Sunday July 15, 2018 @11:57PM (#17538666)
Is it 3 or 4? Is 2 enough?

Let’s say the last message in your example is dropped

B would have 3 acks from A while A only has 2 acks from B.

Will A attack? If not, B is left attacking on their own.

Similarly, what if none of Bs messages make it back to A? How does B know to attack?

Re:Two Generals and Time Machines by nevi-me on Sunday July 15, 2018 @12:39PM (#17535936)
I had a similar comment re. eventual consistency; and I think this is a case of eventual consistency.

I think it doesn't work because the problem becomes "when to retreat". It actually introduces a third state (attack; retreat; do nothing), where I might retreat today, and you do nothing.

Out of interest, if you set a time/date on when to retreat, how would the message look like, and how would you define confirmation for both parties?

Re:Two Generals and Time Machines by FrozenVoid on Sunday July 15, 2018 @01:11PM (#17536068)
Continuous synchronization is a solved problem: https://en.wikipedia.org/wiki/Network_Time_Protocol
Re:Two Generals and Time Machines by gnopgnip on Sunday July 15, 2018 @01:21PM (#17536103)
The problem is that thou never know if they received the last message. Without it there will be uncertainty from at least one of the generals
Re:Two Generals and Time Machines by humbledrone on Sunday July 15, 2018 @12:25PM (#17535867)
Eve could defeat this strategy by dropping all messages.
Re:Two Generals and Time Machines by nevi-me on Sunday July 15, 2018 @12:31PM (#17535899)
Then the network isn't lossy, but it's droppy. If all messages are dropped, one of the conditions of the theorem are invalidated; then it becomes a different problem.
Re:Two Generals and Time Machines by nsuser3 on Sunday July 15, 2018 @12:43PM (#17535953)
Eve could defeat any strategy by dropping all messages.