A Fast Confirmation Rule (aka Fast Synchronous Finality) for the Ethereum Consensus Protocol
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866912613730877440 |
|---|---|
| author | Asgaonkar, Aditya D'Amato, Francesco Saltini, Roberto Zanolini, Luca Zhang, Chenyi |
| author_facet | Asgaonkar, Aditya D'Amato, Francesco Saltini, Roberto Zanolini, Luca Zhang, Chenyi |
| contents | A Confirmation Rule, within blockchain networks, refers to an algorithm implemented by network nodes that determines (either probabilistically or deterministically) the permanence of certain blocks on the blockchain. An example of Confirmation Ruble is the Bitcoin's longest chain Confirmation Rule where a block $b$ is confirmed (with high probability) when it has a sufficiently long chain of successors, its siblings have notably shorter successor chains, the majority of the network's total computation power (hashing) is controlled by honest nodes, and network synchrony holds.
The only Confirmation Rule currently available in the Ethereum protocol, Gasper, is the FFG Finalization Rule. While this Confirmation Rule works under asynchronous network conditions, it is quite slow for many use cases. Specifically, best-case scenario, it takes around 13 to 19 min to confirm a transaction, where the actual figure depends on when the transaction is submitted to the network.
In this work, we devise a Fast Confirmation Rule for Ethereum's consensus protocol. Our Confirmation Rule relies on synchrony conditions, but provides a best-case confirmation time of 12 seconds only, greatly improving on the latency of the FFG Finalization Rule.
Users can then rely on the Confirmation Rule that best suits their needs depending on their belief about the network conditions and the need for a quick response. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_00549 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A Fast Confirmation Rule (aka Fast Synchronous Finality) for the Ethereum Consensus Protocol Asgaonkar, Aditya D'Amato, Francesco Saltini, Roberto Zanolini, Luca Zhang, Chenyi Distributed, Parallel, and Cluster Computing A Confirmation Rule, within blockchain networks, refers to an algorithm implemented by network nodes that determines (either probabilistically or deterministically) the permanence of certain blocks on the blockchain. An example of Confirmation Ruble is the Bitcoin's longest chain Confirmation Rule where a block $b$ is confirmed (with high probability) when it has a sufficiently long chain of successors, its siblings have notably shorter successor chains, the majority of the network's total computation power (hashing) is controlled by honest nodes, and network synchrony holds. The only Confirmation Rule currently available in the Ethereum protocol, Gasper, is the FFG Finalization Rule. While this Confirmation Rule works under asynchronous network conditions, it is quite slow for many use cases. Specifically, best-case scenario, it takes around 13 to 19 min to confirm a transaction, where the actual figure depends on when the transaction is submitted to the network. In this work, we devise a Fast Confirmation Rule for Ethereum's consensus protocol. Our Confirmation Rule relies on synchrony conditions, but provides a best-case confirmation time of 12 seconds only, greatly improving on the latency of the FFG Finalization Rule. Users can then rely on the Confirmation Rule that best suits their needs depending on their belief about the network conditions and the need for a quick response. |
| title | A Fast Confirmation Rule (aka Fast Synchronous Finality) for the Ethereum Consensus Protocol |
| topic | Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2405.00549 |