Profile picture
Ethan MacBrough @emacbrough
, 3 tweets, 2 min read Read on Twitter
A blog post describing an idea I had a while ago on how to (sort of) break an impossibility result and achieve asynchronous consensus tolerating <n/2 Byzantine faults, rather than the standard <n/3. emacbrough.wordpress.com/2018/10/24/syb…
P.S., before someone brings it up without having read the blog post, I'll clarify with "modulo standard ways of getting around FLP". You still need either randomization or partial synchrony. The mechanism in this blog post only gets around the n>=3f+1 result.
By the way, in case people found the post confusing, here's a conversation I just had with @ercwl that might help to clarify the key point.
Missing some Tweet in this thread?
You can try to force a refresh.

Like this thread? Get email updates or save it to PDF!

Subscribe to Ethan MacBrough
Profile picture

Get real-time email alerts when new unrolls are available from this author!

This content may be removed anytime!

Twitter may remove this content at anytime, convert it as a PDF, save and print for later use!

Try unrolling a thread yourself!

how to unroll video

1) Follow Thread Reader App on Twitter so you can easily mention us!

2) Go to a Twitter thread (series of Tweets by the same owner) and mention us with a keyword "unroll" @threadreaderapp unroll

You can practice here first or read more on our help page!

Did Thread Reader help you today?

Support us! We are indie developers!


This site is made by just three indie developers on a laptop doing marketing, support and development! Read more about the story.

Become a Premium Member and get exclusive features!

Premium member ($30.00/year)

Too expensive? Make a small donation by buying us coffee ($5) or help with server cost ($10)

Donate via Paypal Become our Patreon

Thank you for your support!