Proof-of-stake in Tezos¶
This document provides an in-depth description of the Tezos proof-of-stake algorithm. WORK IN PROGRESS, CONSTANTS STILL SUBJECT TO ADJUSTMENT.
The Tezos blockchain is a linked list of blocks. Blocks contain a header, and a list of operations. The header itself decomposes into a shell header (common to all protocols) and a protocol specific header.
The shell header contains
level: the height of the block, from the genesis block
proto: number of protocol changes since genesis (mod 256)
predecessor: the hash of the preceding block.
timestamp: the timestamp at which the block is claimed to have been created.
validation_pass: number of validation passes (also number of lists of lists of operations)
fitness: a sequence of sequences of unsigned bytes, ordered by length and then lexicographically. It represents the claimed fitness of the chain ending in this block.
operations_hashThe root hash of a merkle tree of a list of root hashes of merkle trees for various sets of operations in the block.
contextHash of the state of the context after application of this block. Useful for light clients.
Protocol header (for tezos.alpha):¶
signature: a digital signature of the shell and protocol headers (excluding the signature itself).
priority: the position in the priority list of delegates at which the block was baked.
seed_nonce_hash: a commitment to a random number, used to generate entropy on the chain. Present in only one out of (
BLOCKS_PER_COMMITMENT= 32) blocks.
proof_of_work_nonce: a nonce used to pass a low-difficulty proof-of-work for the block, as a spam prevention measure.
Tezos does not download blocks all at once, but rather considers headers
and various lists of operations separately. In Tezos.alpha, a maximum
size in bytes is applied to the list of transactions
MAX_TRANSACTION_LIST_SIZE = 500kB (that’s 5MB every 10 minutes at
Other lists of operations (endorsements, denunciations, reveals) are limited in terms of number of operations (though the defensive programming style also puts limits on the size of operations it expects).
This ensure that consensus critical operations do not compete with transactions for block space.
Tezos.alpha uses a delegated proof-of-stake model. The acronym DPOS has come to designate a specific type of algorithm used, for instance in Bitshares. This is not the model used in Tezos.alpha, though there is a concept of delegation.
In tezos.alpha, tokens are controlled through a private key called the manager key. Tezos.alpha accounts let the manager specify a public delegate key. This key may be controlled by the manager themselves, or by another party. The responsibility of the delegate is to take part in the proof-of-stake consensus algorithm and in the governance of Tezos.
The manager can generally change the delegate at any time, though contract can be marked to specify an immutable delegate. Though delegation can be changed dynamically, the change only becomes effective after a few cycles.
There are also default accounts in Tezos, which are just the hash of the public key. These accounts do not have an attached delegate key and do not participate in the proof-of-stake algorithm.
Finally, delegate accounts (used for placing safety deposits) are automatically delegated to the delegate itself.
Active and passive delegates¶
A delegate can be marked as either active or passive. A passive delegate cannot be selected for baking or endorsement.
A delegate becomes passive for cycle
n when they fail to create any
of the blocks or endorsements in the past
= 5 cycles, or to change their security deposit. So, in this case, in
n - CYCLES_BEFORE_DEACTIVATION.
A small delegate who is afraid they might be deactivated because they were not given the opportunity to create any block or endorsement can ensure they do not become deactivated by making small, meaningless transactions with their security deposits once every two cycles.
CYCLES_BEFORE_DEACTIVATION a small value means
the chain adapts more quickly to participants disappearing. It’s not
unlike the “difficulty adjustment” of Bitcoin. However, a long value
would ensure that a minority fork progresses more slowly for a longer
period of time than the majority fork.
gives the majority chain a “headstart”.
This does not affect voting rights for protocol changes.
In theory, it would be possible to give each token a serial number, and track the specific tokens assigned to specific delegates. However, it would be too demanding of nodes to track assignment at such a granular level. Instead we introduce the concept of rolls. A roll represents a set of coins delegated to a given key. When tokens are moved, or a delegate for a contract is changed, the rolls change delegate according to the following algorithm.
Each delegate has a stack of roll ids plus some “change” which is always
an amount smaller than
TOKENS_PER_ROLLS. When tokens are moved from
one delegate to the other, first, the change is used. If it is not
enough, rolls need to be “broken” which means that they move from the
delegate stack to a global, unallocated, roll stack. This is done until
the amount is covered, and some change possibly remains.
Then, the other delegate is credited. First the amount is added to the
“change”. If it becomes greater than
TOKENS_PER_ROLLS, then rolls
are unstacked from the global unallocated roll stack onto the delegate
stack. If the global stack is empty, a fresh roll is created.
This preserves the property that if the delegate is changed through several transactions, the roll assignment is preserved, even if each operation moves less than a full roll.
The advantage of tracking tokens in this way is that a delegate creating a malicious fork cannot easily change the specific rolls assigned to them, even if they control the underlying tokens and shuffle them around.
TOKENS_PER_ROLLS = 10,000 tokens and thus there should be
about 80,000 rolls in the Tezos foundation’s planned genesis block,
though the number of rolls will increase with inflation and / or
participation in the delegation.
Roll snapshots represent the state of rolls for a given block. Roll
snapshots are taken every
BLOCKS_PER_ROLL_SNAPSHOT = 256 blocks,
that is 16 times per cycle. There is a tradeoff between memory
consumption and economic efficiency. If roll snapshots are too frequent,
they will consume a lot of memory. If they are too rare, strategic
participants could purchase many tokens in anticipation of a snapshot
and resell them right after.
Blocks in the Tezos.Alpha Blockchain are grouped into cycles of
BLOCKS_PER_CYCLE = 4,096 blocks. Since blocks are at least
TIME_BETWEEN_BLOCKS = one minute apart, this means a cycle lasts at
least 2 days, 20 hours, and 16 minutes. In the following description,
the current cycle is referred to as
n, it is the nth cycle from the
beginning of the chain. Cycle
(n-1) is the cycle that took place
before the current one, cycle
(n-2) the one before, cycle
the one after, etc.
At any point, the tezos shell will not implicitly accept a branch whose
fork point is in a cycle more than
PRESERVED_CYCLES = 5 cycles in the
past (that is at least 14 days, 5 hours, and 20 minutes).
The cost of a security deposit is
BLOCK_SECURITY_DEPOSIT = 512 XTZ
per block created and
ENDORSEMENT_SECURITY_DEPOSIT = 64 XTZ per
Each delegate key has an associated security deposit account.
When a delegate bakes or endorses a block the security deposit is
automatically moved to the deposit account where it is frozen for
PRESERVED_CYCLES cycles, after which it is automatically moved
back to the baker’s main account.
Since deposits are locked for a period of
PRESERVED_CYCLES one can
compute that at any given time, about ((
PRESERVED_CYCLES + 1) *
763e6 = 8.25% of
all tokens should be held as security deposits. It also means that a
delegate should own over 8.25% of the amount of token delegated to them
in order to not miss out on creating any block.
Baking in tezos.alpha is the action of signing and publishing a block.
In Bitcoin, the right to publish a block is associated with solving a
proof-of-work puzzle. In tezos.alpha, the right to publish a block in
n is assigned to a randomly selected roll in a randomly
selected roll snapshot from cycle
We admit, for the time being, that the protocol generates a random seed for each cycle. From this random seed, we can seed a CSPRNG which is used to draw baking rights for a cycle.
To each position, in the cycle, is associated a priority list of delegates. This is drawn randomly, with replacement, from the set of active rolls so it is possible that the same public key appears multiple times in this list. The first baker in the list is the first one who can bake a block at that level. If a delegate is for some reason unable to bake, the next delegate in the list can step up and bake the block.
The delegate with the highest priority can bake a block with a timestamp
TIME_BETWEEN_BLOCKS = one minute. The one with the kth highest
k * TIME_BETWEEN_BLOCKS = k minutes.
Baking a block gives a block reward of
BLOCK_REWARD = 16 XTZ plus
all fees paid by transactions inside the block.
To each baking slot, we associate a list of
ENDORSERS_PER_BLOCK = 32
endorsers. Endorsers are drawn from the set of delegates, by randomly
selecting 32 rolls with replacement.
Each endorser verifies the last block that was baked, say at level
n, and emits an endorsement operation. The endorsement operations
are then baked in block
n+1 and will contribute to the fitness
n. Once block
n+1 is baked, no other endorsement for
n will be considered valid.
Endorsers receive a reward (at the same time as block creators do). The
ENDORSEMENT_REWARD = 2 /
BLOCK_PRIORITY where block
priority starts at 1. So the endorsement reward is only half if the
block of priority 2 for a given slot is being endorsed.
It is possible that the same endorser be selected
k times for the
same block, in this case
k deposits are required and
gained. However a single operation needs to be sent on the network to
k times the same block.
Inflation from block rewards and endorsement reward is at most
80 XTZ. This means at most 5.51% annual inflation.
n is associated with a random seed, a 256 bit number generated
at the end of cycle
(n-PRESERVED_CYCLES-1) using commitments made during
(n-PRESERVED_CYCLES-2), in one out of every
BLOCKS_PER_COMMITMENT = 32 blocks.
The commitment must be revealed by the original baker during cycle
(n-PRESERVED_CYCLES-1) under penalty of forfeiting the rewards and
fees of the block that included the seed commitment (the associated
security deposit is not forfeited).
A revelation is an operation, and multiple revelations can thus be
included in a block. A baker receives a
1/8 XTZ reward for including a revelation.
Revelations are free operations which do not compete with transactions
for block space. Up to
MAX_REVELATIONS_PER_BLOCK = 32 revelations
can be contained in any given block. Thus, 1 /
BLOCKS_PER_COMMITMENT) = 1/1024 of
the blocks in the cycle are sufficient to include all revelations.
The revelations are hashed together to generate a random seed at the
very end of cycle
The seed of cycle
(n-PRESERVED_CYCLES-2) is hashed with a constant
and then with each revelation of cycle
Once computed, this new seed is stored and used during cycle
If two endorsements are made for the same slot or two blocks at the same height by a delegate, this can be denounced. The denunciation would typically be made by the baker, who includes it as a special operation. In a first time, denunciation will only forfeit the security deposit for the doubly signed operation. However, over time, as the risk of accidental double signing becomes small enough, denunciation will forfeit the entirety of the safety deposits. Half is burned, and half is added to the block reward.