Briefing
The foundational problem of blockchain scalability is rooted in the necessity for a strict, global total ordering of all transactions, a requirement that inherently bottlenecks throughput by forcing sequential processing. This research introduces Setchain , a novel ledger structure that fundamentally relaxes this constraint by organizing transactions into a sequence of epochs , where all elements within a single epoch are unordered. This architectural shift enables concurrent processing of transactions within an epoch, leading to orders of magnitude higher throughput than the underlying block-based ledger. The core mechanism is secured by cryptographic epoch-proofs, which allow light clients to safely verify the correctness of an epoch from a distributed service, effectively front-loading the entire theoretical picture of a highly parallelized, yet cryptographically verifiable, decentralized system.
Context
The prevailing theoretical limitation in permissionless blockchains is the scalability trilemma , where existing architectures struggle to maintain decentralization, security, and high throughput simultaneously. Specifically, the requirement of a global, canonical, and strict total order for all transactions → a necessity for state machine replication → forces a sequential execution model. This bottleneck limits transaction processing to the capacity of a single block producer and a single-threaded state transition function, creating a fundamental ceiling on throughput that is independent of network bandwidth or computational power. This established constraint has driven the development of complex sharding and Layer-2 solutions, all attempting to circumvent the total order requirement without compromising security.
Analysis
Setchain operates by abstracting the traditional block-based ledger into a sequence of sets, termed epochs , where the critical constraint is the ordering between epochs, not within them. Conceptually, the system moves from a single, ordered list of transactions to a list of unordered batches. This architectural decoupling allows nodes to process the transactions within an epoch in parallel, drastically increasing the system’s execution capacity. To maintain security and allow for stateless client interaction, the design utilizes epoch-proofs.
These proofs are cryptographic signatures of the epoch’s hash, generated by a quorum of Byzantine-fault-tolerant servers. A light client verifies the correctness of an epoch by simply obtaining and validating $f+1$ epoch-proofs, where $f$ is the maximum number of Byzantine servers, transforming the burden of state verification into a simple cryptographic check.
Parameters
- Throughput Improvement → Orders of magnitude higher throughput → The Setchain algorithms demonstrate transaction throughput orders of magnitude greater than the underlying CometBFT blockchain.
- Finality Latency → Below 4 seconds → The measured time required for the Setchain algorithms to achieve finality across different server cluster configurations.
- Epoch Verification Quorum → $f+1$ epoch-proofs → The minimum number of cryptographic proofs required for a light client to safely verify the correctness of an epoch, where $f$ is the maximum assumed number of Byzantine servers.
Outlook
The Setchain model establishes a new paradigm for ledger design, moving beyond the decades-old sequential block structure. The immediate next step involves formalizing the integration of this epoch-based structure with a full-featured Virtual Machine (VM) to manage complex state transitions, not just transaction inclusion. Within 3-5 years, this theoretical foundation could unlock a new generation of Layer 1 architectures that natively support massive parallel execution without sharding, enabling a truly global-scale decentralized application ecosystem. The research opens new avenues for mechanism design, focusing on how to optimally batch and order transactions into epochs to maximize fairness and efficiency, replacing the current MEV competition over single-block ordering with a new game over epoch composition.
