Struct SyncableServer 

pub struct SyncableServer<S: ShardStore<H = MerkleHashVote, CheckpointId = u32>> { /* private fields */ }

A GenericTreeServer augmented with per-block leaf tracking for the crate::sync_api::TreeSyncApi.

The sync protocol needs to know which leaves were appended in each block so that clients can download compact-block diffs. That tracking is a sync concern, not a tree concern, so it lives here rather than on GenericTreeServer.

Use the MemoryTreeServer type alias for the common in-memory case.

Implementations

impl SyncableServer<MemoryShardStore<MerkleHashVote, u32>>

pub fn empty() -> Self

Create an empty in-memory syncable tree.

impl<S> SyncableServer<S>

where S: ShardStore<H = MerkleHashVote, CheckpointId = u32>, S::Error: Debug,

pub fn new(tree: GenericTreeServer<S>) -> Self

Wrap an existing GenericTreeServer with sync tracking.

pub fn append(&mut self, leaf: Fp) -> Result<u64, ShardTreeError<S::Error>>

Append a single leaf and record it in the pending block.

pub fn append_two( &mut self, first: Fp, second: Fp, ) -> Result<u64, ShardTreeError<S::Error>>

Append two leaves (e.g. new VAN + VC from MsgCastVote).

pub fn checkpoint( &mut self, height: u32, ) -> Result<(), CheckpointError<S::Error>>

Snapshot the current tree state and record block-level commitments.

Errors

Returns CheckpointError::NotMonotonic if height is not strictly greater than the previous checkpoint height.

pub fn root(&self) -> Fp

Current Merkle root (at the latest checkpoint).

pub fn root_at_height(&self, height: u32) -> Option<Fp>

Root at a specific checkpoint height.

pub fn size(&self) -> u64

Number of leaves appended.

pub fn path(&self, position: u64, anchor_height: u32) -> Option<MerklePath>

Build a Merkle path for the leaf at position at anchor_height.

pub fn latest_checkpoint(&self) -> Option<u32>

Latest checkpoint height.

Trait Implementations

impl<S> TreeSyncApi for SyncableServer<S>

where S: ShardStore<H = MerkleHashVote, CheckpointId = u32>, S::Error: Debug,

type Error = Infallible

SyncableServer never fails when serving sync data — the blocks map is an in-memory BTreeMap and all root lookups are infallible.

fn get_block_commitments( &self, from_height: u32, to_height: u32, ) -> Result<Vec<BlockCommitments>, Infallible>

Fetch commitments per block in a height range (primary sync method).

fn get_root_at_height(&self, height: u32) -> Result<Option<Fp>, Infallible>

Fetch tree root at a checkpoint height (anchor verification).

fn get_tree_state(&self) -> Result<TreeState, Infallible>

Fetch current tree state (next_index, root, latest height).