Assert that the point satisfies the curve equation and subgroup checks.
Compare two points for equality.
Point to compare.
Whether the points are equal.
Check whether the point is the point at infinity.
Whether the point is zero.
Check whether the point lies in a small torsion subgroup.
Whether the point has small order.
Check whether the point belongs to the prime-order subgroup.
Whether the point is torsion-free.
Multiply the point by a scalar in constant time.
Implementations keep the subgroup-scalar contract strict and may reject
0 instead of returning the identity point.
Scalar multiplier.
Product point.
Multiply the point by a scalar without constant-time guarantees.
Public-scalar callers that need 0 should use this method instead of
relying on multiply(...) to return the identity point.
Scalar multiplier.
Product point.
Massively speeds up p.multiply(n) by using precompute tables (caching). See wNAF.
Cache state lives in internal WeakMaps keyed by point identity, not on the point object.
Repeating precompute(...) for the same point identity replaces the remembered window size
and forces table regeneration for that point.
OptionalwindowSize: numberPrecompute window size.
OptionalisLazy: booleancalculate cache now. Default (true) ensures it's deferred to first multiply()
Same point instance with precompute tables attached.
Converts point to 2D xy affine coordinates.
OptionalinvertedZ: FOptional inverted Z coordinate for batch normalization.
Affine x/y coordinates.
Encode the point into the curve's canonical byte form.
Encoded point bytes.
Encode the point into the curve's canonical hex form.
Encoded point hex.
Base interface for all elliptic-curve point instances.