Struct grin_core::pow::lean::Lean

pub struct Lean { /* fields omitted */ }

Lean miner implementation aiming to be as short and simple as possible. As a consequence, it's a little less than 10 times slower than John Tromp's implementation, as it's not optimized for performance and reuses croaring which is likely sub-optimal for this task.

Methods

impl Lean

pub fn new(edge_bits: u8) -> Lean

Instantiates a new lean miner based on some Cuckatoo parameters

pub fn set_header_nonce(&mut self, header: Vec<u8>, nonce: u32)

Sets the header and nonce to seed the graph

pub fn trim(&mut self)

Trim edges in the Cuckatoo graph. This applies multiple trimming rounds and works well for Cuckatoo size above 18.

pub fn find_cycles(
    &self,
    ctx: CuckatooContext<u32>
) -> Result<Vec<Proof>, Error>

Finds the Cuckatoo Cycles on the remaining edges. Delegates the finding to a context, passing the trimmed edges iterator.