Linear Scalability
Traditional blockchains hit throughput ceilings. Adding more nodes doesn't help because every node must process every transaction in sequence. Radius takes a different approach: sharded state with parallel execution.
State sharding model
State consists of key : value pairs representing data elements used with Radius Network, including smart contract code, their "data", and account balances. Radius distributes distinct state elements across multiple independent shard clusters:
Each shard:
- Runs as a 3-node Raft cluster (tolerates 1 node failure)
- Stores a partition of the global state
- Processes transactions independently of other shards
Why this scales linearly
| Shards | Keyspace per shard | Throughput |
|---|---|---|
| 1 | 100% | 1x |
| 2 | 50% each | ~2x |
| 4 | 25% each | ~4x |
| N | 1/N each | ~Nx |
Double the shards, approximately double the throughput for non-conflicting workloads. The system supports up to 16.7 million shards (24-bit shard indexing).
How sharding works
State Partitioning
Keys are hashed and distributed across shards via a prefix tree. When the system scales:
- New shard cluster starts
- Routing table updates with new keyspace assignment
- Keys migrate lazily on first access
- Old shard forwards lookups to new location
Zero-Downtime Scaling
Scaling operations happen without interrupting service:
Parallel Execution
Transactions accessing different keys execute simultaneously. No global ordering required:
Only transactions touching the same keys require coordination.
The Architecture
Radius uses a distributed architecture based on PArSEC (Parallel Sharded Transactions with Contracts):
Why No Blocks?
Traditional blockchains batch transactions into blocks for consensus and propagation. Radius eliminates these constraints:
| Aspect | Blockchain | Radius |
|---|---|---|
| Consensus | Global (all nodes agree on block) | Per-shard (Raft replication) |
| Ordering | Sequential (one block at a time) | Parallel (independent shards) |
| Propagation | Broadcast blocks to all nodes | Direct writes to relevant shards |
| Finality | Probabilistic (wait for confirmations) | Immediate |
Per-Shard Consensus
Instead of global consensus on a block of transactions, Radius achieves consensus per-shard using Raft. Each shard independently replicates its state changes. This means:
- No mining or proof-of-work
- No validator coordination overhead
- No block production delays
- Immediate finality once Raft commits
Congestion Control
When multiple transactions compete for the same key, Radius uses intelligent batching:
- Detection: Shards track which keys cause transaction conflicts
- Routing: Frontend routes conflicting transactions to the same backend
- Batching: Backend executes conflicting transactions sequentially within a single batch
- Efficiency: One lock acquisition serves the entire batch
Specialized Shards
Radius supports heterogeneous shard configurations for different access patterns:
| Shard Type | Purpose | Use Case |
|---|---|---|
| Regular | General state storage | Default workloads |
| Receipt | Transaction receipts | Append-heavy, read-light |
| Edge | Specific contracts/keys | High-traffic contracts |
Edge shards allow routing high-traffic contracts to dedicated infrastructure without affecting the rest of the system.
Live Metrics
Track real-time network performance:
- Dashboard → — Live TPS, settlement times, shard health
Compared to Other Approaches
| Approach | Scaling Method | Consistency | Complexity |
|---|---|---|---|
| L1 Blockchain | Vertical (bigger nodes) | Global ordering | Low |
| Rollups/L2 | Multiple chains | Bridge-dependent | High |
| Radius | Horizontal (add shards) | Per-shard consensus | Transparent |
Next Steps
- Designed for the Internet of Tomorrow — EVM compatibility and differences
- JSON-RPC API — Complete API reference
- Quick Start — Get from zero to first transaction