equix::solution

Function check_tree_sums

Source 
fn check_tree_sums(
    func: &HashX,
    items: &[SolutionItem],
    n_bits: usize,
) -> Result<u64, ()>
Expand description

Check hash sums recursively.

The main solution constraint in HashX is a partial sum at each tree level. The overall match required is EQUIHASH_N bits, and each subsequent tree level needs a match half this long.

Each recursive invocation returns the entire sum if its layer has the indicated number of matching bits.