Chop Chop: Byzantine Atomic Broadcast to the Network Limit
Guardat en:
| Publicat a: | arXiv.org (Aug 28, 2024), p. n/a |
|---|---|
| Autor principal: | |
| Altres autors: | , , , , |
| Publicat: |
Cornell University Library, arXiv.org
|
| Matèries: | |
| Accés en línia: | Citation/Abstract Full text outside of ProQuest |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|
MARC
| LEADER | 00000nab a2200000uu 4500 | ||
|---|---|---|---|
| 001 | 2802173973 | ||
| 003 | UK-CbPIL | ||
| 022 | |a 2331-8422 | ||
| 035 | |a 2802173973 | ||
| 045 | 0 | |b d20240828 | |
| 100 | 1 | |a Camaioni, Martina | |
| 245 | 1 | |a Chop Chop: Byzantine Atomic Broadcast to the Network Limit | |
| 260 | |b Cornell University Library, arXiv.org |c Aug 28, 2024 | ||
| 513 | |a Working Paper | ||
| 520 | 3 | |a At the heart of state machine replication, the celebrated technique enabling decentralized and secure universal computation, lies Atomic Broadcast, a fundamental communication primitive that orders, authenticates, and deduplicates messages. This paper presents Chop Chop, a Byzantine Atomic Broadcast system that uses a novel authenticated memory pool to amortize the cost of ordering, authenticating and deduplicating messages, achieving "line rate" (i.e., closely matching the complexity of a protocol that does not ensure any ordering, authentication or Byzantine resilience) even when processing messages as small as 8 bytes. Chop Chop attains this performance by means of a new form of batching we call distillation. A distilled batch is a set of messages that are fast to authenticate, deduplicate, and order. Batches are distilled using a novel interactive protocol involving brokers, an untrusted layer of facilitating processes between clients and servers. In a geo-distributed deployment of 64 medium-sized servers, Chop Chop processes 43,600,000 messages per second with an average latency of 3.6 seconds. Under the same conditions, state-of-the-art alternatives offer two orders of magnitude less throughput for the same latency. We showcase three simple Chop Chop applications: a Payment system, an Auction house and a "Pixel war" game, respectively achieving 32, 2.3 and 35 million operations per second. | |
| 653 | |a Distillation | ||
| 653 | |a Clients | ||
| 653 | |a Servers | ||
| 653 | |a Messages | ||
| 653 | |a Payment systems | ||
| 653 | |a Broadcasting | ||
| 653 | |a Authentication | ||
| 653 | |a Cloud computing | ||
| 653 | |a State machines | ||
| 700 | 1 | |a Guerraoui, Rachid | |
| 700 | 1 | |a Monti, Matteo | |
| 700 | 1 | |a Pierre-Louis, Roman | |
| 700 | 1 | |a Vidigueira, Manuel | |
| 700 | 1 | |a Gauthier Voron | |
| 773 | 0 | |t arXiv.org |g (Aug 28, 2024), p. n/a | |
| 786 | 0 | |d ProQuest |t Engineering Database | |
| 856 | 4 | 1 | |3 Citation/Abstract |u https://www.proquest.com/docview/2802173973/abstract/embedded/6A8EOT78XXH2IG52?source=fedsrch |
| 856 | 4 | 0 | |3 Full text outside of ProQuest |u http://arxiv.org/abs/2304.07081 |