Struct RocksDbStore 

pub struct RocksDbStore {
    db: DB,
}

RocksDB-backed JMT store with bounded memory usage.

Three column families:

• jmt_nodes: borsh(NodeKey) -> borsh(Node)
• jmt_values: key_hash(32) || version(8 BE) -> raw value bytes (empty = tombstone)
• jmt_stale: stale_since_version(8 BE) || borsh(NodeKey) -> ()

The values CF key layout enables seek_for_prev to efficiently find the latest value at or before a given version for a key hash.

Fields

db: DB

Implementations

impl RocksDbStore

pub fn open(path: impl AsRef<Path>) -> Result<Self>

pub fn write_tree_update_batch(&self, update: TreeUpdateBatch) -> Result<()>

Write a full TreeUpdateBatch atomically (nodes + values + stale indices).

pub fn prune(&self, up_to_version: Version) -> Result<(usize, usize)>

Prune stale nodes up to (inclusive) the given version.

Value pruning is disabled by default until checkpoint compaction is implemented. A dormant key can have its latest live value at an old version, so deleting values by version alone can make the latest root impossible to prove. The non-default prune-values feature keeps the old experimental behavior available for research and benchmarks. Returns (nodes_pruned, values_pruned).

fn prune_stale_nodes(&self, up_to_version: Version) -> Result<usize>

fn prune_values(&self, up_to_version: Version) -> Result<usize>

pub fn num_nodes(&self) -> Result<usize>

pub fn num_values(&self) -> Result<usize>

pub fn is_empty(&self) -> Result<bool>

pub fn copy_latest_root_to_version(&self, to_version: Version) -> Result<bool>

Copy a JMT root node to a later version without changing tree contents.

JMT itself only writes a root node when a tree has updates. Runtime batches can still inherit an unchanged root, so checkpointing the root at the accepted version keeps exact-version startup verification cheap.

pub fn latest_root_version(&self) -> Result<Option<Version>>

fn latest_root_metadata(&self) -> Result<Option<(Version, Vec<u8>)>>

pub fn compact_all(&self) -> Result<()>

Compact all commitment-store column families.

This rewrites RocksDB’s LSM files after pruning or large batch runs so deleted stale-node keys stop occupying disk. It does not change logical JMT contents or versioned values.

fn count_cf(&self, cf_name: &str) -> Result<usize>

Trait Implementations

impl TreeReader for RocksDbStore

fn get_node_option(&self, node_key: &NodeKey) -> Result<Option<Node>>

Gets node given a node key. Returns None if the node does not exist.

fn get_value_option( &self, max_version: Version, key_hash: KeyHash, ) -> Result<Option<OwnedValue>>

Gets a value by identifier, returning the newest value whose version is less than or equal to the specified version. Returns None if the value does not exist.

fn get_rightmost_leaf(&self) -> Result<Option<(NodeKey, LeafNode)>>

Gets the rightmost leaf. Note that this assumes we are in the process of restoring the tree and all nodes are at the same version.

fn get_node(&self, node_key: &NodeKey) -> Result<Node, Error>

Gets node given a node key. Returns error if the node does not exist.

fn get_value( &self, max_version: u64, key_hash: KeyHash, ) -> Result<Vec<u8>, Error>

Gets a value by identifier, returning the newest value whose version is less than or equal to the specified version. Returns an error if the value does not exist.

impl TreeWriter for RocksDbStore

fn write_node_batch(&self, node_batch: &NodeBatch) -> Result<()>

Writes a node batch into storage.