[−][src]Struct grin_core::pow::lean::Lean
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.
Implementations
impl Lean
[src]
pub fn new(edge_bits: u8) -> Lean
[src]
Instantiates a new lean miner based on some Cuckatoo parameters
pub fn set_header_nonce(&mut self, header: Vec<u8>, nonce: u32)
[src]
Sets the header and nonce to seed the graph
pub fn trim(&mut self)
[src]
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>
[src]
&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.
Auto Trait Implementations
impl RefUnwindSafe for Lean
impl Send for Lean
impl Sync for Lean
impl Unpin for Lean
impl UnwindSafe for Lean
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> Erased for T
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T> Same<T> for T
type Output = T
Should always be Self
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
[src]
impl<T> UnsafeAny for T where
T: Any,
T: Any,