A distributed consensus algorithm can be “fully” or “weakly” synchronous as well as “asynchronous”.
What does this mean for such an algorithm’s utility?
Watching the Parsec material it’s clear to me its authors relate to asynchronous as a big advantage, but, can asynchronous also mean that finality is delayed compared to other algorithms?
gives some background
Would love to learn your thoughts, thanks,