Candidate validation
A proposal is checked against the chain context and required state-transition rules before it can gain the votes needed for finalization.
Inspect MACA’s proposal, prevote, precommit, and finalization model, including quorum, message separation, and view changes.
Illustrated coordination. No live network activity.
MACA’s consensus core operates on explicit proposals, validator state, and signed messages. Networking delivers the inputs; the consensus rules determine what those inputs justify.
A proposal is checked against the chain context and required state-transition rules before it can gain the votes needed for finalization.
The quorum threshold is calculated from stake, with overflow-safe intermediate arithmetic. Empty stake cannot form a valid quorum.
Signatures include a message domain and relevant block, height, epoch, and round context. This binds a vote to the decision it was intended to support.
When a candidate fails or a proposer times out, validators can advance to another view under explicit rules instead of improvising a fallback.
Epochs provide a defined point for validator-set transitions and derivation of the next election seed. The next round operates against an explicit participant set.
The protocol includes a formal model for bounded safety analysis. Model results depend on their assumptions and do not replace deployment testing or prove every liveness condition.
Check the candidate block, expected context, and validity conditions.
Accumulate the required prevotes and precommits from the active stake.
Finalize with the supporting precommits, or follow the view-change path when progress stalls.
Safety concerns avoiding conflicting finalized decisions. Liveness concerns continued progress. Each depends on stated network and fault assumptions, and must be evaluated separately.
No. It provides evidence about the modeled rules and assumptions. Software implementation, operator behavior, configuration, and live network conditions require additional verification.