Authority rotates, the chain doesn't.

The blockchainto build on.

A consensus where validators take scheduled turns, every block is final on commit, and no reorg is possible by design.

Foundations

By design,
not by promise.

01

Immediate Finality

Every block commits in a single round. No fork choice, no longest-chain rule, no reorganizations, no waiting for confirmations. A block that reaches quorum is the canonical block at that height — settled the moment it exists.

02

Verifiable State

State is committed to a sparse Merkle tree. Any value can be proven against a state root, and the proof verifies without trusting the server that produced it. Clients holding only a root can check a balance — no sync, no trust, no intermediary.

03

Proof of Rotating Authority

Proposer selection rotates deterministically with every block height and every consensus round. The validator set rotates at epoch boundaries, sized so rotation can never break quorum. The chain doesn't reorganize; the authority to produce the next block does.

04

Economic Enforcement

Rewards and slashing are computed by the protocol, not voted on. A validator that signs two conflicting votes loses stake and future earnings — the slashing is automatic because a signature is a mathematical fact, not an opinion. The pot mechanism smooths staker rewards across epochs.

Workflow

Three steps.
No trusted middle.

terminal
1# Generate a fresh keystore
2./address --new -o mywallet --network regtest
3
4# Output:
5#   mnemonic    seat spin gun clinic earth trash ...
6#   reward      rclrty1qqktjn87xfapx3tepuserag...
7#   consensus   5cab747984018f73c3dac5979254b...
Regtest
Guarantees

Security is
the design.

These aren't features that can be enabled or disabled. They're properties of the protocol itself — enforced by consensus rules, not by policy.

BFTSlashingMerkle proofsEd25519Immediate finality

BFT consensus

Tolerates one-third of validators being faulty. Quorum requires two-thirds plus one. No single party can advance the chain alone.

Automatic slashing

A validator that signs two conflicting votes loses stake and future earnings. Enforcement is mathematical, not a vote.

Verifiable state

Every value is provable against a Merkle root. A client holding only a state root can verify without trusting the server that answered.

Immutable history

Every committed block is final. No reorgs, no fork choice, no probabilistic settlement. History cannot be rewritten.

Follow the
build.

Clarity is pre-launch. The chain runs, the explorer runs, and the code is open. If you want to see what a BFT chain looks like before it's polished, this is the moment to watch.

Building in public. Feedback welcome.