Thanks John.
>From my minimal local testing I have at least that
- random sampling on the jacobian can find every point on the jacobian
(there is a fast method using sums of J(P) for P on the curve, but this
doesnt guarantee all elements of the jacobian are found)
- that multiplication by any
I'm going to forward this to sage-nt as there may be people who read that
but not this.
Meanwhile I would recommend getting something to work correctly before
worrying too much about what is most efficient.
John
On Wed, 6 Mar 2024, 12:52 Giacomo Pope, wrote:
> *=== Summary*
>
> Arithmetic of
*=== Summary*
Arithmetic of divisors for Jacobians of hyperelliptic curves with two
points at infinity is not currently properly supported for SageMath. Worse,
there are no checks or error handling and the output of the arithmetic is
simply wrong.
Minimal example:
sage: R. =
