Skip to content

Commit 9b3dc49

Browse files
committed
Apply suggestions
1 parent 9e261ce commit 9b3dc49

File tree

2 files changed

+38
-13
lines changed

2 files changed

+38
-13
lines changed

llms.txt

Lines changed: 24 additions & 12 deletions
Original file line numberDiff line numberDiff line change
@@ -16021,7 +16021,7 @@ title: Elastic Scaling
1602116021
description: Learn how elastic scaling in Polkadot boosts parachain throughput, reduces latency, and supports dynamic, cost-efficient resource allocation.
1602216022
---
1602316023

16024-
# Elastic Scaling
16024+
# Elastic Scaling
1602516025

1602616026
## Introduction
1602716027

@@ -16033,13 +16033,19 @@ This technical advancement enables parachains to process multiple blocks within
1603316033

1603416034
## How Elastic Scaling Works
1603516035

16036-
Elastic scaling enables parachains to process multiple blocks in parallel by utilizing additional cores on the relay chain. This section provides a technical analysis of the performance advantages and implementation details.
16036+
Elastic scaling enables parachains to process multiple blocks in parallel by utilizing additional cores on the relay chain. This section provides a technical analysis of the performance advantages and details of the implementation.
1603716037

16038-
Consider a parachain that needs to process four consecutive parablocks (P1-P4). With traditional single-core allocation, the validation process follows a strictly sequential pattern. Each parablock undergoes a two-phase process on the relay chain:
16038+
Consider a parachain that needs to process four consecutive parablocks. With traditional single-core allocation, the validation process follows a strictly sequential pattern. Each parablock undergoes a two-phase process on the relay chain:
1603916039

1604016040
1. **Backing phase** - validators create and distribute validity statements
1604116041
2. **Inclusion phase** - the parablock is included in the relay chain after availability verification
1604216042

16043+
Throughout the following diagrams, specific notation is used to represent different components of the system:
16044+
16045+
- R1, R2, ... - relay chain blocks (produced at ~6-second intervals)
16046+
- P1, P2, ... - parachain blocks that need validation and inclusion
16047+
- C1, C2, ... - cores on the relay chain
16048+
1604316049
In the single-core scenario (assuming a 6-second relay chain block time), processing four parablocks requires approximately 30 seconds:
1604416050

1604516051
```mermaid
@@ -16094,13 +16100,20 @@ sequenceDiagram
1609416100
end
1609516101
```
1609616102

16097-
The relay chain processes these multiple parablocks as independent validation units during backing, availability, and approval phases. However, during inclusion, it verifies that their state roots align properly to maintain chain consistency.
16103+
To help interpret the sequence diagrams above, note the following key elements:
16104+
16105+
- The horizontal axis represents time progression through relay chain blocks (R1-R5)
16106+
- Each colored rectangle shows processing on a specific core (C1 or C2)
16107+
- In the single-core scenario, all blocks must be processed sequentially on one core
16108+
- In the multi-core scenario, blocks are processed in parallel across multiple cores, reducing total time
16109+
16110+
The relay chain processes these multiple parablocks as independent validation units during the backing, availability, and approval phases. However, during inclusion, it verifies that their state roots align properly to maintain chain consistency.
1609816111

1609916112
From an implementation perspective:
1610016113

16101-
- **Parachain side** - collators must increase their block production rate to fully utilize multiple cores
16102-
- **Validation process** - each core operates independently but with coordinated state verification
16103-
- **Resource management** -cores are dynamically allocated based on parachain requirements
16114+
- **Parachain side** - collators must increase their block production rate to utilize multiple cores fully
16115+
- **Validation process** - each core operates independently, but with coordinated state verification
16116+
- **Resource management** - cores are dynamically allocated based on parachain requirements
1610416117
- **State consistency** - while backed and processed in parallel, the parablocks maintain sequential state transitions
1610516118

1610616119
## Benefits of Elastic Scaling
@@ -16109,21 +16122,21 @@ From an implementation perspective:
1610916122

1611016123
- **Lower latency** - transaction finality improves substantially with multi-core processing. Parachains currently achieve 2-second latency with three cores, with projected improvements to 500ms using 12 cores, enabling near-real-time application responsiveness
1611116124

16112-
- **Resource efficiency** - applications acquire computational resources precisely matched to their needs, eliminating wasteful over-provisioning. Coretime can be purchased at granular intervals (blocks, hours, days), creating cost-effective operations particularly for applications with variable transaction patterns
16125+
- **Resource efficiency** - applications acquire computational resources precisely matched to their needs, eliminating wasteful over-provisioning. Coretime can be purchased at granular intervals (blocks, hours, days), creating cost-effective operations, particularly for applications with variable transaction patterns
1611316126

1611416127
- **Scalable growth** - new applications can launch with minimal initial resource commitment and scale dynamically as adoption increases. This eliminates the traditional paradox of either over-allocating resources (increasing costs) or under-allocating (degrading performance) during growth phases
1611516128

1611616129
- **Workload distribution** - parachains intelligently distribute workloads across cores during peak demand periods and release resources when traffic subsides. Paired with secondary coretime markets, this ensures maximum resource utilization across the entire network ecosystem
1611716130

16118-
- **Reliable performance** - end-users experience reliable application performance regardless of network congestion levels. Applications maintain responsiveness even during traffic spikes, eliminating performance degradation that commonly impacts blockchain applications during high-demand periods.
16131+
- **Reliable performance** - end-users experience reliable application performance regardless of network congestion levels. Applications maintain responsiveness even during traffic spikes, eliminating performance degradation that commonly impacts blockchain applications during high-demand periods
1611916132

1612016133
## Use Cases
1612116134

16122-
Elastic scaling enables applications to dynamically adjust their resource consumption based on real-time demand. This is especially valuable for decentralized applications where usage patterns can be highly variable. The following examples illustrate common scenarios where elastic scaling delivers significant performance and cost-efficiency benefits:
16135+
Elastic scaling enables applications to dynamically adjust their resource consumption based on real-time demand. This is especially valuable for decentralized applications where usage patterns can be highly variable. The following examples illustrate common scenarios where elastic scaling delivers significant performance and cost-efficiency benefits.
1612316136

1612416137
### Handling Sudden Traffic Spikes
1612516138

16126-
Many decentralized applications experience unpredictable, high-volume traffic bursts, especially in areas like gaming, DeFi protocols, NFT auctions, messaging platforms, and social media. Elastic scaling allows these systems to acquire additional coretime during peak usage and release it during quieter periods, ensuring responsiveness without incurring constant high infrastructure costs.
16139+
Many decentralized applications experience unpredictable, high-volume traffic bursts, especially in gaming, DeFi protocols, NFT auctions, messaging platforms, and social media. Elastic scaling allows these systems to acquire additional coretime during peak usage and release it during quieter periods, ensuring responsiveness without incurring constant high infrastructure costs.
1612716140

1612816141
### Supporting Early-Stage Growth
1612916142

@@ -16132,7 +16145,6 @@ Startups and new projects often begin with uncertain or volatile demand. With el
1613216145
### Scaling Massive IoT Networks
1613316146

1613416147
Internet of Things (IoT) applications often involve processing data from millions of devices in real time. Elastic scaling supports this need by enabling high-throughput transaction processing as demand fluctuates. Combined with Polkadot’s shared security model, it provides a reliable and privacy-preserving foundation for large-scale IoT deployments.
16135-
IoT Applications
1613616148

1613716149
### Powering Real-Time, Low-Latency Systems
1613816150

polkadot-protocol/architecture/polkadot-chain/elastic-scaling.md

Lines changed: 14 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -17,11 +17,17 @@ This technical advancement enables parachains to process multiple blocks within
1717

1818
Elastic scaling enables parachains to process multiple blocks in parallel by utilizing additional cores on the relay chain. This section provides a technical analysis of the performance advantages and details of the implementation.
1919

20-
Consider a parachain that needs to process four consecutive parablocks (P1-P4). With traditional single-core allocation, the validation process follows a strictly sequential pattern. Each parablock undergoes a two-phase process on the relay chain:
20+
Consider a parachain that needs to process four consecutive parablocks. With traditional single-core allocation, the validation process follows a strictly sequential pattern. Each parablock undergoes a two-phase process on the relay chain:
2121

2222
1. **Backing phase** - validators create and distribute validity statements
2323
2. **Inclusion phase** - the parablock is included in the relay chain after availability verification
2424

25+
Throughout the following diagrams, specific notation is used to represent different components of the system:
26+
27+
- R1, R2, ... - relay chain blocks (produced at ~6-second intervals)
28+
- P1, P2, ... - parachain blocks that need validation and inclusion
29+
- C1, C2, ... - cores on the relay chain
30+
2531
In the single-core scenario (assuming a 6-second relay chain block time), processing four parablocks requires approximately 30 seconds:
2632

2733
```mermaid
@@ -76,6 +82,13 @@ sequenceDiagram
7682
end
7783
```
7884

85+
To help interpret the sequence diagrams above, note the following key elements:
86+
87+
- The horizontal axis represents time progression through relay chain blocks (R1-R5)
88+
- Each colored rectangle shows processing on a specific core (C1 or C2)
89+
- In the single-core scenario, all blocks must be processed sequentially on one core
90+
- In the multi-core scenario, blocks are processed in parallel across multiple cores, reducing total time
91+
7992
The relay chain processes these multiple parablocks as independent validation units during the backing, availability, and approval phases. However, during inclusion, it verifies that their state roots align properly to maintain chain consistency.
8093

8194
From an implementation perspective:

0 commit comments

Comments
 (0)