Briefing
The paper addresses the fundamental scalability limitations inherent in traditional blockchains, which impose a strict total order on all transactions. It proposes Setchain, a novel distributed object that relaxes this strict ordering by organizing transactions into unordered sets called epochs, while maintaining order between these epochs. This foundational breakthrough, coupled with the introduction of epoch-proofs for verifiable client interaction, allows for orders of magnitude higher transaction throughput and significantly reduced latency, thereby enabling the development of more performant and scalable decentralized architectures.
Context
Prior to this research, blockchain systems grappled with the scalability trilemma, often sacrificing throughput and latency to maintain decentralization and security. Traditional blockchain designs mandated a global, strict total order for all transactions, a requirement that inherently limited the rate at which transactions could be processed and finalized. This prevailing theoretical limitation meant that even with advancements in consensus algorithms, achieving high transaction per second (TPS) rates without compromising other core properties remained an unsolved foundational problem.
Analysis
The core mechanism of Setchain involves transforming the blockchain’s linear sequence of individually ordered transactions into a sequence of “epochs,” where each epoch is a set of transactions without internal ordering. This conceptual shift allows for parallel processing of transactions within an epoch, fundamentally differing from previous approaches that serialize all operations. The paper introduces three algorithms built upon a block-based ledger like CometBFT. “Vanilla” serves as a baseline, directly mapping Setchain elements to ledger transactions.
“Compresschain” enhances throughput by batching and compressing elements into larger ledger transactions. The most significant advancement is “Hashchain,” which commits only a cryptographic hash of an epoch’s batch to the underlying ledger, drastically reducing on-chain data footprint and communication overhead. This approach necessitates a distributed hash-reversal service to retrieve full epoch contents. Crucially, Setchain integrates “epoch-proofs,” which are cryptographic signatures of epoch hashes, enabling light clients to verify the correctness of an epoch with a minimal number of proofs from Byzantine-tolerant servers, thereby ensuring verifiable interaction with a single server.
Parameters
- Core Concept ∞ Setchain
- New Algorithms ∞ Vanilla, Compresschain, Hashchain
- Key Authors ∞ Arivarasan Karmegam et al.
- Underlying Ledger ∞ CometBFT
- Achieved Throughput (Hashchain) ∞ 133,882 elements/second (without hash-reversal bottleneck)
- Finality Latency ∞ Below 4 seconds (for Compresschain and Hashchain)
- Byzantine Fault Tolerance ∞ Up to f < n/2 servers
Outlook
Future research in this area will focus on deploying Setchain algorithms in more distributed environments to fully assess their scalability limits and real-world performance. Exploring alternative, lighter underlying consensus services, such as set consensus or Malachite, could further enhance performance by removing potential bottlenecks presented by the current block-based ledger. Additionally, optimizing the hash-reversal technique in Hashchain is a key next step to unlock its full throughput potential. This theoretical framework could enable new categories of DeFi applications requiring high throughput and low latency, and facilitate the development of more efficient and adaptable decentralized infrastructures.
