Expand description
v0.147: signed registry checkpoints.
A checkpoint is a registry operator’s signed claim that at sequence N the registry held exactly the given set of entries, summarized by a content-addressed root over the canonical entry list. Consumers verify the signature against the operator’s pubkey, recompute the root from the registry they hold, and assert the two agree.
Forms a chain via previous_checkpoint; v0.148 federation
cross-checks the chain across hubs.
The root is a sha256 over canonical bytes of an alphabetically-
sorted list of (vfr_id, latest_snapshot_hash, latest_event_log_hash, owner_pubkey, signature) tuples. It is
NOT a Merkle tree at v0.147; per-entry inclusion proofs would
require committing to a Merkle structure and a future cycle
can extend the shape if needed. The flat root is sufficient
for the substrate-honest “two hubs agree on registry state”
claim that v0.148 federation lands on.
Structs§
Constants§
Functions§
- compute_
registry_ root - Compute the registry root: sha256 over canonical bytes of an
alphabetically-sorted list of
(vfr_id, latest_snapshot_hash, latest_event_log_hash, owner_pubkey, signature)tuples. Two hubs that hold the same entries produce the same root.