NADO
Every node builds every block.
No leader. No proposer. No waiting.
In NADO a block is a pure function of the chain and the mempool. Given the same parent and the same transactions, every node computes the identical block — so nobody has to propose it, nobody has to wait for it, and nobody can hold a slot hostage. This page shows how that works, why it does not fork, and the next block as the network computes it right now.
The next block, as every node computes it
Live from a public node. This is not a proposal from a leader — it is the deterministic result any node on this tip arrives at from its pool. Refreshes every few seconds.
Source: GET https://get.nadochain.com/next_block_txids and /status. Any node answers the same question; ask a few and compare.
How a block is born
Proposer chains work by election: one node builds, everyone else waits and votes. NADO works by computation: everyone builds, and the maths guarantees the results agree.
Try it: six nodes, one function
A tiny simulation of the real rule. Each node hashes the sorted ids of its mature transactions on top of the same parent. Watch what happens when a transaction reaches one node late, and how the network resolves it without anybody being in charge.
The simulation hashes with SHA-256 for brevity; the chain uses blake2b over the full block preimage. The rules shown — sorted mature tx set, reconcile before building, superset wins a same-height tie — are the chain's actual rules.
Keeping the pools equal
Four layers, cheapest first. None of them is a leader; all of them make the block function's input the same everywhere by the time it runs.
1 · Push gossip
A transaction is pushed to every peer the instant a node accepts it — first sight only, so the flood stops the moment everyone has it. One hop per edge, no leader relaying.
2 · Pull reconcile
Every second, nodes whose pool hash differs exchange txid lists and fetch only the bodies they lack. Anything push missed — a node that was down, a dropped packet — converges here.
3 · Inclusion delay
A transaction names the earliest height it may land, a few blocks after submission. That gives propagation a head start over assembly, so a tx is nearly always everywhere before any node may include it.
4 · Pre-assembly reconcile
Right before it builds, a node asks its peers “what would you put in the next block on this tip?” and fetches the difference. The mesh converges on the union of its next-block sets inside the slot — no block is built on a stale view.
When two blocks still appear at one height
If a transaction reaches node A but not node B in the last few hundred milliseconds before the slot, they build two different blocks. Fork weight is content-independent, so that is an exact tie. NADO breaks it deterministically — and in favour of the better pool.
The more complete block wins
Both sides fetch the other's first divergent block and compare transaction sets. A strict superset wins; otherwise the larger set; only equal sets fall back to the lowest hash. Everyone computes the same answer, once.
Adoption is instant
The winning block carries the transaction the loser lacked, so the losing node can validate and adopt it immediately — the tx lands, nothing is re-mined, and “propagate faster” is the winning strategy rather than a coin flip.
Weight still rules
The tie-break only decides exact ties. Fork choice is cumulative bonded weight, and finality is a stake-signed checkpoint plus a hard floor no rollback may cross — a split can never undo what is final.
Side by side
| Property | NADO (shared production) | Tendermint / Tenderbake | Nakamoto PoW |
|---|---|---|---|
| Who builds the block | Every node, identically | One proposer per round | Whoever finds the hash |
| Waiting on a specific party | Never | Yes — the proposer, then a ⅔ vote | Yes — the miner's propagation |
| Can one party censor a slot | No — there is no slot owner | Yes, for its round | Yes, for its block |
| Winner can be offline | Yes — credited by address | No | No |
| Hardware advantage | None (a draw, not a race) | None | All of it |
| Block carries a signature the chain depends on | No | Yes | No |
| Same-height conflict | Deterministic tie-break, more complete pool wins | Prevented by the vote | Longest chain, eventually |
| What must agree | The mempool at the slot (bandwidth) | ⅔ of stake, every block (rounds) | Nothing — work decides |
Read the details
The full write-up — the block function, what is and is not hashed, every convergence layer with its parameters, the tie-break proof of symmetry, the failure modes and how each resolves, and the incidents that shaped the rules.
Leaderless block assembly
doc/leaderless-assembly.md — the design document.
Mining & the draw
doc/mining.md — two lanes, the beacon, fidelity, win-while-offline.
Finality
doc/finality.md — stake-signed checkpoints and the un-crossable floor.