Prove impossible

[AndySilva]

How is it possible to prove reaching an agreement using any Byzantine consensus algorithm is not achievable:

When there are 4 processes and 1 failure
inputs to the correct processes are from the set {0,10,100, 1000}


Thanks in advance
Andy Silva

As the others have noted this is a topic that's more likely to get a useful answer in Highly Technical, so I have moved it over there.
-ViRGE

 

[GLeeM]

Welcome to the forum, AndySilva 🙂

 

[Ken g6]

This seems to be related to:

http://en.wikipedia.org/wiki/Consensus_(computer_science)#Impossibility

I doubt that anyone here knows the answer to your question. I'd never even heard of this before. Although Rudy Toody could surprise me. Maybe try the Programming or Highly Technical forum?

 

[Rudy Toody]

This seems to be related to:

http://en.wikipedia.org/wiki/Consensus_(computer_science)#Impossibility

I doubt that anyone here knows the answer to your question. I'd never even heard of this before. Although Rudy Toody could surprise me. Maybe try the Programming or Highly Technical forum?

Perhaps you could attack this problem as a hologram. Snippets of holograms have all of the information of the whole hologram. I'm assuming that when a snippet goes missing, the remaining information is still valid.

That's off the top of my little pea brain because I'm not well versed in fault tolerances or group decisions.