Docs
v1

Concept

Architecture

How Tenrai is built. Miners produce work blocks in parallel, a validator committee certifies cuts, and every cut is final. The TRAIDAG pipeline in one page.

On this page

Tenrai separates two jobs that most chains bind together. Proof of work produces blocks, as many as the network can carry. Proof of stake decides, every 2.5 seconds, which of them count and in which order. The design is called TRAIDAG.

The pipeline

The TRAIDAG pipeline. Miners find work blocks in parallel with proof of work. Then, with proof of stake, a cut registers the blocks, a fixed rule orders them, the next cut executes them, the committee signs the cut, and the signed cut is final. PROOF OF WORK PROOF OF STAKE · ONE CUT EVERY 2.5 S Mine work blocks, ~50 per second Register a cut lists what arrived Order one fixed rule on every node Execute the next cut runs them Certify the committee signs the cut Final no rollback, no reorg
Work blocks are found in parallel; one certified cut every 2.5 seconds makes them final.
  1. Miners find work blocks with TenQ. Each block carries up to 10 transactions and names a finalized cut as its anchor. Many miners find blocks at the same time: 50 per second on average across the network, and up to 100 in bursts.
  2. A cut registers the valid work blocks that reached the network in time.
  3. Registered blocks are ordered by a fixed rule that every node computes the same way.
  4. A later cut executes them in that order: it spends and creates outputs and applies staking operations.
  5. The validator committee signs the cut. With enough signatures the cut is certified.
  6. A certified cut is final. It is never rolled back.

Why two layers

Tenrai signs with ML-DSA-65, a post-quantum scheme whose signatures are 3,309 bytes each. A committee of 64 produces up to 64 of them per certificate. Certifying every block at 50 blocks per second would mean 50 certificates of about 200 KiB each second. Certifying a cut means one every 2.5 seconds.

So a work block needs no committee signature at all, and the large certificates are spent once per cut.

No fork choice

TRAIDAG has no longest chain and no heaviest branch. Valid work that registers in time is never discarded because another miner was faster, and there is no reorganization that could undo a payment.

Work blocks do reference up to 16 earlier blocks as parents, and a node can draw a graph from them. Those references are hints for propagation and for explorers. They decide nothing: not the order, not the rewards, not the difficulty, not finality.

Who does what

RoleRunsDoes
Minertenrai-miner, a pool or bridgeFinds work blocks, earns half of emission and fees
Validatortenraid with a validator keyVotes on cuts; with its delegators earns the other half
NodetenraidChecks everything, stores the chain, relays, serves the API
ClientWallets, explorers, the SDKReads the chain and submits transactions

State

All balances live in unspent outputs, as in Bitcoin. Besides the output set the chain keeps a registry of public keys that have spent before, the validator registry, the stake positions and the accounting of emission. Each is committed by a 48-byte root, and every cut binds all of them into one state commitment. That commitment is what the committee signs.

Read on

Type to search guides, concepts and reference pages.