Struct Table 

pub struct Table<C: Curve> { /* private fields */ }

Every multiple of the generator this algorithm needs.

The windows live on the heap and are pushed one at a time. An array sized for the widest curve would be about 116 KiB for P-521, and building it as a stack temporary before moving it into the OnceLock overflowed the stack – which is how this first failed, in the FIPS self-test doctests. A Vec also sizes each curve to what it actually uses rather than to P-521.

Implementations

impl<C: Curve> Table<C>

pub fn build() -> Self

Build it. Costs a little over one scalar multiplication, once.

pub fn mul(&self, scalar: &C::Scalar) -> Point<C>

scalar * G.