Struct grin_chain::txhashset::TxHashSet

pub struct TxHashSet { /* fields omitted */ }

An easy to manipulate structure holding the 3 sum trees necessary to validate blocks and capturing the Output set, the range proofs and the kernels. Also handles the index of Commitments to positions in the output and range proof pmmr trees.

Note that the index is never authoritative, only the trees are guaranteed to indicate whether an output is spent or not. The index may have commitments that have already been spent, even with pruning enabled.

Methods

impl TxHashSet

pub fn open(
    root_dir: String,
    commit_index: Arc<ChainStore>,
    header: Option<&BlockHeader>
) -> Result<TxHashSet, Error>

Open an existing or new set of backends for the TxHashSet

pub fn release_backend_files(&mut self)

Close all backend file handles

pub fn is_unspent(
    &self,
    output_id: &OutputIdentifier
) -> Result<OutputMMRPosition, Error>

Check if an output is unspent. We look in the index to find the output MMR pos. Then we check the entry in the output MMR and confirm the hash matches.

pub fn last_n_output(&self, distance: u64) -> Vec<(Hash, OutputIdentifier)>

returns the last N nodes inserted into the tree (i.e. the 'bottom' nodes at level 0 TODO: These need to return the actual data from the flat-files instead of hashes now

pub fn last_n_rangeproof(&self, distance: u64) -> Vec<(Hash, RangeProof)>

as above, for range proofs

pub fn last_n_kernel(&self, distance: u64) -> Vec<(Hash, TxKernel)>

as above, for kernels

pub fn get_block_header(&self, hash: &Hash) -> Result<BlockHeader, Error>

Convenience function to query the db for a header by its hash.

pub fn get_all_output_pos(&self) -> Result<Vec<(Commitment, u64)>, Error>

Get all outputs MMR pos

pub fn outputs_by_insertion_index(
    &self,
    start_index: u64,
    max_count: u64
) -> (u64, Vec<OutputIdentifier>)

returns outputs from the given insertion (leaf) index up to the specified limit. Also returns the last index actually populated

pub fn highest_output_insertion_index(&self) -> u64

highest output insertion index available

pub fn rangeproofs_by_insertion_index(
    &self,
    start_index: u64,
    max_count: u64
) -> (u64, Vec<RangeProof>)

As above, for rangeproofs

pub fn find_kernel(
    &self,
    excess: &Commitment,
    min_index: Option<u64>,
    max_index: Option<u64>
) -> Option<(TxKernel, u64)>

Find a kernel with a given excess. Work backwards from max_index to min_index

pub fn roots(&self) -> TxHashSetRoots

Get MMR roots.

pub fn get_output_pos(&self, commit: &Commitment) -> Result<u64, Error>

Return Commit's MMR position

pub fn merkle_proof(&mut self, commit: Commitment) -> Result<MerkleProof, Error>

build a new merkle proof for the given position.

pub fn compact(
    &mut self,
    horizon_header: &BlockHeader,
    batch: &mut Batch
) -> Result<(), Error>

Compact the MMR data files and flush the rm logs

pub fn rebuild_height_pos_index(
    &self,
    header_pmmr: &PMMRHandle<BlockHeader>,
    batch: &mut Batch
) -> Result<(), Error>

Rebuild the index of block height & MMR positions to the corresponding UTXOs. This is a costly operation performed only when we receive a full new chain state. Note: only called by compact.