Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
HenryR
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
10 ms
·
91.
▲
by
HenryR
18y ago
The impossibility proof actually stands if you require only one processor to decide (this is mentioned explicitly in the paper). So X out of N is just as hard as N out of N. Some methods for ensuring a total ordering on message delivery req
92.
▲
by
HenryR
18y ago
That's arguable - you certainly need all nodes to agree in lots of applications. And if you add a maximum time for computation, where do you set the line? Especially in mobile networks, computations can take a wildly varying length of time.