Struct chain_vote::TallyOptimizationTable

pub struct TallyOptimizationTable {
    table: HashMap<Option<[u8; 32]>, u64>,
    baby_step_size: u64,
    giant_step: GroupElement,
}

Holds precomputed baby steps for the baby-stap giant-step algorithm for solving discrete log on ECC

Fields

table: HashMap<Option<[u8; 32]>, u64>

baby_step_size: u64

giant_step: GroupElement

Implementations

impl BabyStepsTable

pub fn generate(max_value: NonZeroU64) -> Self

Generate the table with asymmetrical steps, optimized for multiple reuse of the same table.

pub fn generate_with_balance(max_value: NonZeroU64, balance: NonZeroU64) -> Self

Generate the table with the given balance. Balance is used to make steps asymmetrical. If the table is reused multiple times with the same max_value it is recommended to set a balance > 1, since this will allow to cache more results, at the expense of a higher memory footprint.

For example, a balance of 2 means that the table will precompute 2 times more baby steps than the standard O(sqrt(n)), 1 means symmetrical steps.

Trait Implementations

impl Clone for BabyStepsTable

fn clone(&self) -> BabyStepsTable

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for BabyStepsTable

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.