Docs Protocol
Parameters
Every New Constellation parameter as Acrux Net runs it, where each comes from, and the figures measured on the net.
Acrux Net runs the parameters of the paper's Table 1, with the values the paper leaves open set as below. Every value is a key in the node's configuration; see Configuration.
Protocol
| Parameter | Meaning | Acrux Net | Source |
|---|---|---|---|
| k | concurrent proposers per window | 3 | Table 1 |
| κ | slots per consensus slot | 4 | Table 1 |
| w | slots per window | 16 | Table 1 |
| δlocal | maximum network delay between co-located proposers | 10 ms | Table 1 |
| δblock | length of a slot | 50 ms | Table 1 |
| δglobal | maximum network delay across the network | 250 ms | Table 1 |
| Δtimeout | Alpenglow base timeout | 750 ms (3δglobal) | Acrux: the lower bound assumption (T) allows |
| m | execution tracks per slot | 4 | Section 3.3 |
| bcu | compute units per track per slot | 2,000,000 (8,000,000 per slot) | Acrux |
| ρ | fee-payer reserve | 0.001 SOL | Section 3.4 |
| fragment expiry | how long unmatched fragments stay cached | 8 slots (400 ms) after the first accepted fragment | Acrux |
| α | share of windows assigned by hub stake | 1/2 | Section 3.1 |
| n_min | minimum members of an active hub | 4 | Acrux |
| ρ_min | minimum hub stake of an active hub | 1% of total stake | Acrux |
| Γ, γ | shreds per slice, shreds needed to rebuild | 64, 32 | Alpenglow |
Derived
| Value | Formula | Acrux Net |
|---|---|---|
| δcblock, consensus slot length | κ · δblock | 200 ms |
| window length | w · δblock | 800 ms |
| consensus slots per window | w / κ | 4 |
| hash exchange window | 2δlocal | 20 ms |
| timeout of the j-th cblock of a window | Δtimeout + j · δcblock + δblock | 1,000, 1,200, 1,400, 1,600 ms |
| attestation deadline | δblock + 2δglobal + 2δlocal | 570 ms |
| agreed set, minimum size | more than k/2 | 2 |
| inclusion fees per fee payer per proposer per window | ρ / (2k) | 166,666 lamports |
| slice payload | 64 shreds of about 1.2 KB, rebuilt from 32 | about 38 KB |
Conditions the parameters meet
The paper's proofs need two inequalities, assumption (T). Acrux Net meets both:
| Condition | Acrux Net |
|---|---|
| Δtimeout ≥ 3δglobal | 750 ms ≥ 750 ms |
| 2δlocal ≤ δglobal | 20 ms ≤ 250 ms |
And for a window with an offline proposer to finalize its last cblock as early as a window of three correct proposers:
| Condition | Acrux Net |
|---|---|
| w · δblock ≥ δblock + 2δglobal + 2δlocal | 800 ms ≥ 570 ms |
Choices Acrux made
The paper leaves these to the implementation:
| Choice | Acrux |
|---|---|
| Block cipher | ChaCha20-Poly1305, one fresh key per block, H(K) in the header |
| Erasure code for shreds and fragments | Reed-Solomon |
| Key shares for threshold transactions | Shamir over GF(256) |
| Transport between nodes | QUIC |
| Hash exchange redundancy | every commitment sent several times; no forwarding round |
| Window ordering | SIMD-0675 regional runs |
| Execution | Solana Virtual Machine, through Agave's SVM API |
The byte layouts are in Wire formats.
Acrux Net
| Genesis hubs | FRA, NYC, TYO |
| Validators per hub | 4 |
| Proposers per window | 3, drawn from the window's hub |
| Delay within a hub | within δlocal |
One-way delays between the hubs:
| Link | One-way delay |
|---|---|
FRA-NYC | 39 to 41 ms |
FRA-TYO | 55 to 57 ms |
NYC-TYO | 62 to 64 ms |
| inside a hub | 1 to 4 ms |
Measured on Acrux Net
Ten minutes fault-free on the twelve validators, 50 transfers per second: 2 640 cblocks finalized, every cblock of the run, 0 skips, and 0 mismatches in 10 564 state-hash checks across the validators.
| Figure | p50 | p99 |
|---|---|---|
| Slot pacing within a window, start to start | 50 ms | 51.3 ms |
| Commit spread, first to last commitment of a slot | 4.7 ms | 12 ms |
| Attestation arrival at validators in every hub, after the block's first commitment | 48.5 ms | 76.1 ms |
| cblock finalization, first slot to finalized | 324 ms | 398 ms |
Window handover
At a window boundary the next hub's proposers start on ParentReady, which needs the 60% certificate of the window before. Each link's floor is the slot's 50 ms plus the arrival of the second hub's votes for that certificate, computed from the link delays with Rotor's relays in every hub; every link's p99 sits within 20 ms of its floor.
| Link | p50 | p99 | Floor |
|---|---|---|---|
FRA-FRA | 149.1 ms | 156.1 ms | 134.9 ms |
NYC-NYC | 149.3 ms | 156.0 ms | 134.9 ms |
TYO-TYO | 180.6 ms | 189.0 ms | 166.7 ms |
FRA-NYC | 184.3 ms | 187.6 ms | 169.9 ms |
NYC-TYO | 163.6 ms | 163.7 ms | 150.8 ms |
TYO-FRA | 170.2 ms | 171.9 ms | 158.4 ms |
With one proposer down for a whole window there were no skips: the window continued on P = {1, 2} (Crash).
Live values, at p50 and p99 with their sample size, are served by GET /v1/facts.