Struct Checkpoint 

pub struct Checkpoint { /* private fields */ }

A parsed checkpoint (signed-tree-head body).

Implementations

impl Checkpoint

pub fn new(origin: &str, size: u64, root_hash: Hash) -> Result<Self>

Build a checkpoint with no extension lines.

Errors

Returns Error::MalformedCheckpoint if origin is empty or contains a newline.

pub fn with_extensions( origin: &str, size: u64, root_hash: Hash, extensions: Vec<String>, ) -> Result<Self>

Build a checkpoint with explicit extension lines.

Errors

Returns Error::MalformedCheckpoint if origin is empty/contains a newline, or any extension line is empty or contains a newline.

pub fn origin(&self) -> &str

The log origin (identity) line.

pub fn size(&self) -> u64

The tree size (number of leaves).

pub fn root_hash(&self) -> &Hash

The RFC 6962 root hash at this tree size.

pub fn extensions(&self) -> &[String]

The opaque extension lines (usually empty).

pub fn parse(text: &str) -> Result<Self>

Parse a checkpoint body (the note text), byte-for-byte per the spec.

Errors

Returns Error::MalformedCheckpoint for a missing/empty origin, a non-decimal or leading-zero size, a root hash that is not exactly 32 bytes once base64-decoded, fewer than three lines, or an empty extension line.

pub fn marshal(&self) -> String

Serialize the checkpoint body (the note text), ending in a newline.

pub fn from_signed_note(msg: &str, trusted: &[VerifierKey]) -> Result<Self>

Parse and verify a full signed checkpoint, returning the checkpoint body.

The msg is the complete signed note (body + blank line + signature lines). It is verified against trusted (at least one trusted signature — e.g. the log’s Ed25519 key, or a witness co-signature — must verify), then its body is parsed as a checkpoint.

Errors

Propagates crate::note::SignedNote::parse / verify errors and Checkpoint::parse errors.

pub fn verify_inclusion( &self, leaf_index: u64, leaf_hash: &[u8], proof: &[Vec<u8>], ) -> Result<()>

Verify that leaf_hash is included at leaf_index in the tree committed by this checkpoint, using the Slice-1 RFC 6962/9162 verifier.

Errors

Propagates crate::proof::verify_inclusion errors (index out of range, wrong proof size, hash-length, or root mismatch).

pub fn verify_consistency( &self, newer: &Checkpoint, proof: &[Vec<u8>], ) -> Result<()>

Verify that this (older) checkpoint is consistent with a newer one — i.e. the newer tree is an append-only extension — using the Slice-1 RFC 6962/9162 consistency verifier. This is the anti-equivocation walk a monitor performs across checkpoints.

Errors

Propagates crate::proof::verify_consistency errors, including a root mismatch if the proof does not bind both tree heads.

Trait Implementations

impl Clone for Checkpoint

fn clone(&self) -> Checkpoint

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for Checkpoint

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Eq for Checkpoint

impl PartialEq for Checkpoint

fn eq(&self, other: &Checkpoint) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for Checkpoint