Carbon: An Asynchronous Voting-Based Payment System for a Client-Server Architecture

Martina Camaioni, Rachid Guerraoui, Jovan Komatovic, Matteo Monti, Manuel VidigueiraarXiv 2022 · arXiv · OpenReview

Abstract

We present Carbon, an asynchronous payment system. To the best of our knowledge, Carbon is the first asynchronous payment system designed specifically for a client-server architecture. Namely, besides being able to make payments, clients of Carbon are capable of changing the set of running servers using a novel voting mechanism -- asynchronous, balance-based voting.

Introduction

Modern distributed ledgers often rely on consensus protocols to establish a total ordering of transactions. While this ensures consistency, it introduces significant performance bottlenecks, particularly in global, geo-distributed environments where network latency is high and unpredictable. Carbon challenges the necessity of total ordering for specific applications like payments and voting. By ensuring that a single dollar cannot be spent twice without requiring a global sequence for all concurrent transactions, Carbon achieves unprecedented scalability while maintaining safety under asynchrony.

System Architecture

Carbon's architecture is built around three distinct roles, designed to leverage both trusted and untrusted resources efficiently. This hybrid approach allows the system to scale to levels previously unseen in secure, asynchronous systems.

Carbon Architecture and Operation Flow
  1. Validators: A permissioned set of trusted servers that maintain the system state and finalize operations. They use Merkle Patricia Trees to ensure storage efficiency, keeping the footprint per account constant.
  2. Brokers: A permissionless layer of untrusted, stateless servers. Brokers act as intermediaries that perform heavy cryptographic lifting. Because they are untrusted, a malicious broker can only delay a transaction but cannot compromise system integrity or forge payments.
  3. Clients: End-users who initiate payments or participate in system governance.

Core Protocols: Draft and Dibs

The system's performance is driven by two primary protocols that optimize communication and computation.

Draft is a Byzantine Reliable Broadcast (BRB) protocol. Instead of validators individually verifying every client's signature—a significant CPU drain—untrusted brokers collect and aggregate thousands of client signatures into a single, constant-sized BLS multi-signature. Validators then only need to verify this one aggregate signature, reducing the authentication workload by approximately 3.7x.

Dibs is an asynchronous identifier assignment protocol. It allows clients to claim short, numeric IDs, removing the need to include bulky cryptographic public keys in every transaction. As shown in the table below, the combination of Dibs and Draft significantly reduces the total message size.

Bandwidth efficiency comparison of Carbon's protocols

Performance and Scalability

Evaluated on a global AWS deployment across 20 regions (including Tokyo, Paris, and São Paulo), Carbon demonstrated a sustained throughput of 1,000,000 transactions per second (tx/s). This performance was achieved with a "provable delivery" latency of approximately 11 seconds.

In comparative testing, Carbon outperformed industry standards like Algorand and Quorum by three orders of magnitude. It also significantly exceeded the performance of FastPay, a high-performance consensus-less system, which reached approximately 5,200 tx/s before scaling issues occurred. Unlike consensus-based systems where performance often degrades as the number of nodes increases due to communication overhead, Carbon’s reliance on Reliable Broadcast ensures stable performance during scaling.

User-Driven Reconfiguration

A unique feature of Carbon is its asynchronous, balance-based voting mechanism. Unlike static systems, Carbon allows clients to vote validators in or out of the active set. This "stake-less" voting is based on account balances but does not require users to lock up their funds. This ensures the system remains resilient and can adapt its validator set to reflect the community's trust.

Conclusion and Future Work

Carbon demonstrates that by decoupling payment integrity from total ordering and utilizing untrusted brokers for cryptographic offloading, distributed payment systems can reach the scale required for global central bank digital currencies (CBDCs). While currently optimized for payments, future research will focus on integrating privacy-preserving techniques like zero-knowledge proofs and extending the consensus-free model to support complex smart contracts.

Summary updated

Abstract

We present Carbon, an asynchronous payment system. To the best of our knowledge, Carbon is the first asynchronous payment system designed specifically for a client-server architecture. Namely, besides being able to make payments, clients of Carbon are capable of changing the set of running servers using a novel voting mechanism -- asynchronous, balance-based voting.
BibTeX
@misc{camaioni2022carbon,
  author = {Martina Camaioni and Rachid Guerraoui and Jovan Komatovic and Matteo Monti and Manuel Vidigueira},
  title = {{Carbon: An Asynchronous Voting-Based Payment System for a Client-Server Architecture}},
  year = {2022},
  eprint = {2209.09580},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2209.09580},
}
Figure