Lune

S&P2023Top-tier venue

Optimistic Fast Confirmation While Tolerating Malicious Majority in Blockchains

Ruomu Hou, Haifeng Yu

2023Year
2Top-tier citations

Abstract

The robustness of a blockchain against the adversary is often characterized by the maximum fraction (fmax) of adversarial power that it can tolerate. While most existing blockchains can only tolerate fmax⁡<12{f_{\max }} < \frac{1}{2} or lower, there are some blockchain systems that are able to tolerate a malicious majority, namely fmax⁡≥12{f_{\max }} \geq \frac{1}{2}. A key price paid by such blockchains, however, is their large confirmation latency. This work aims to significantly reduce the confirmation latency in such blockchains, under the common case where the actual fraction f of adversarial power is relatively small. To this end, we propose a novel blockchain called Flint. Flint tolerates fmax⁡≥12{f_{\max }} \geq \frac{1}{2} and can give optimistic execution (i.e., fast confirmation) whenever f is relatively small. Our experiments show that the fast confirmation in Flint only takes a few minutes, as compared to several hours of confirmation latency in prior works.

Ask about this paper

Your agent reads all of it.

Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.

Questions to start from

Your agent calls

Luneget_paper_fulltext

Ask in Lune

Free to start. No credit card required.

lune papers fulltext fdca5f2f-2426-48c7-8917-933447b83edc

Cited by top-tier papers2

Ask how each one uses it

Builds on12

Related papers

Dusk over the sea between two cliffs drawn in fine vertical lines