Docs Start
Overview
What Acrux is, the four things it has, and where to start in these docs.
Acrux is the first implementation of New Constellation, the multiple-concurrent-proposer design for Alpenglow published by Quentin Kniep and Roger Wattenhofer of the Solana Foundation on 2026-11-14. Every 50 ms slot has three proposers instead of one leader. Each one seals its block, commits to it, attests which co-proposers were on time and releases its key. Validators merge all accepted blocks into one order by priority fee. No proposer controls what is included or in what order, and no proposer sees the others' transactions before its own block is fixed.
What Acrux has
| What it is | Where | |
|---|---|---|
| Acrux Net | A live network of hubs, FRA, NYC and TYO, running New Constellation: three proposers per window, 50 ms slots, windows of 16 slots rotating between hubs, Alpenglow voting every fourth slot. | /net |
| acrux-node | The node: the paper's proposer, validator, proposer schedule and transaction selection (Algorithms 1 to 4), with Rotor, Alpenglow on cblocks, t-of-n threshold transactions, the fee-payer reserve and execution on the Solana Virtual Machine. Its acrux CLI runs a local multi-hub cluster in one command or follows Acrux Net and re-executes every slot. | Run a node |
| Fault Lab | The attacks New Constellation is built against, run on a sandbox cluster with a fixed seed, each ending in the protocol's answer and its evidence. | /lab |
| Hub Registry | A Solana mainnet program where hubs are registered by code and location and validators join them by identity. From it and real stake, Acrux computes the proposer schedule for the next epoch. | /hubs |
One call
await acrux.send(tx, { n: 3, t: 2 })This sends a transaction to three proposers of its target slot, split so that any two rebuild it and none can read it alone. Quickstart takes you from nothing to that transaction finalized.
Where to start
The paper
New Constellation: Multiple Concurrent Proposers for Alpenglow, v1.0, Kniep and Wattenhofer, Solana Foundation, 2026-11-14. Read the PDF. Each algorithm line and each lemma beside the code and scenario that implement it is on /spec.