Jul 26, 2020 · We also give an algorithm to explicitly compute the probability that a given slot encounters a consistency violation under the idealized leader.

We present an asymptotically optimal consistency analysis assuming that an honest round is more likely than an adversarial round.

Abstract—We improve the fundamental security threshold of eventual consensus Proof-of-Stake (PoS) blockchain protocols under the longest-chain rule by ...

We improve the fundamental security threshold of eventual consensus Proof-of-Stake (PoS) blockchain protocols under longest-chain rule, reflecting for the ...

Jan 22, 2020 · The role of these slots is rather delicate: while it is good for the system to have many honest blocks, concurrent blocks can help the ...

We present an asymptotically optimal consistency analysis assuming that an honest round is more likely than an adversarial round (i.e., Pr[S]+Pr[M] > Pr[A]); ...

We improve the fundamental security threshold of eventual consensus Proof-of-Stake (PoS) blockchain protocols under the longest-chain rule by showing, ...

Consistency of Proof-of-Stake Blockchains with Concurrent Honest Slot Leaders ; Aggelos Kiayias ;,. Saad Quader ;,. Alexander Russell.

We present a model of longest-chain proof-of-stake protocols, formalized by the Ouroborous line of work [25,13,3] and subsequent improvements [8, 24] .

Apr 25, 2020 · In our paper, we put forth a consistency analysis that takes advantage of these events and thus achieves an asymptotically optimal consistency ...