SolidusExplorer
⌘K
FINALITY
BLOCK HEIGHT
ACTIVE VALIDATORS

The Quorum Certificate Behind Every Block: Well Built, and Invisible From Outside

What a certificate is for

A block on its own is a proposal. One participant assembled it and signed it, and nothing about that makes it agreed.

The certificate is the agreement. It says a quorum of the committee saw this specific block and voted for it, and it is what turns a proposal into something the chain will not reverse.

So it is not a detail of the consensus mechanism. It is the evidence for the chain's central claim.

The structure is well designed

Four things: the hash of the block being certified, the round, an aggregate signature, and a bitvector naming which committee members signed.

The bitvector is the part worth praising. An aggregate signature is compact, and on its own it would tell you that enough parties signed without telling you which. The bitvector makes the signer set explicit, and the code exposes a count derived from it directly.

That is the right shape, and it is why the rest of this page is about exposure rather than design.

And you cannot see one

Four plausible method names were tried against the public endpoint. All four returned method-not-found.

And a block does not carry one. A block fetched at the tip has ten fields: a hash, a height, a parent hash, a proposer, a round, a state root, a timestamp, its transactions, a transactions root and a count.

No signature. No signer set. No justification. No certificate.

CONTROL: the same response does carry the proposer and the round, so those fields are absent rather than the response being cut short.

What that costs a reader

You can see who proposed a block. You cannot see who agreed to it.

So "this block is final" is not checkable from the public surface. You can read the block, its parent, its state root and its contents, and you cannot obtain the artefact that says a quorum certified it.

For a chain whose finality is the property it is built on, that is the one thing an explorer most needs to expose, and it is the thing it does not.

And it qualifies a measurement this estate already published

We counted four distinct proposers across recent blocks and used that to describe the producing committee.

Counting proposers is not counting signers. A proposer is one participant; a certificate names the set that voted. Without certificates on the read surface, the committee's size is measurable only through who proposes, which is a weaker observation than it first appears, and this page is the correction of emphasis.

The specification, with its qualifier

The protocol's target design is a 21-of-100 committee, elected by verifiable random function. That design is not deployed, and no committee of that size has run, so a certificate today aggregates a handful of signatures rather than twenty-one.

A certificate over four signatures and one over twenty-one prove the same thing mathematically. Only the first has happened here.

One boundary on this page

The RPC crate we read registers six methods. The live endpoint answers several beyond those six, which means at least one other registration site exists that we did not read.

So "no method returns a certificate" is a statement about what the live endpoint answered to four tried names, not a claim to have enumerated every method the service implements. A method we did not guess could exist.

What you can check yourself

solidus_getBlock with a height, then list its keys

Count the fields and look for anything certificate-shaped. And note the round, which is not the height, so a block at one height can carry a much larger round number.

Keep reading

The Quorum Certificate Behind Every Block: Well Built, and Invisible From Outside · Solidus — Solidus Explorer