An ideal model of the Leios voting scheme

This gives an ideal model of voting as a small state machine and proves the central correctness property:

If a certificate for a block exists, then at least one honest node has validated that block.

The functionality records a vote only if the voter validated the block whenever it is honest; a dishonest voter may vote on anything. A certificate is a quorum of threshold-many distinct voters. As long as the adversary controls fewer than threshold parties, every certifying set contains an honest voter, whose validation the invariant WF provides.

The ideal functionality

Well-formed

Certificates and correctness

The adversary is modelled by a list corrupt of the parties it controls, shorter than the threshold (the honest-participation assumption); every dishonest voter must be in it.