Albin Ahlbäck

> I'm not sure I understand We usually check aliasing, such as `fmpz_add(x, x, y)` works and is consistent with `fmpz_add(z, x, y)` (here `z` and `x` are two different...

> You want the evaluation to check aliasing then? Since it was in the previous commit (and contained in similar tests), I would very much like that! > I can...

My bad. Yes, looks good! Will wait until Fredrik comes back from his vacation to see if he has any more opinions.

Yes, seems to be correct in what you say. Would you mind opening a PR for this?

Would changing the first sentence from > FLINT is a C library for doing number theory, freely available under the [GNU LGPL](https://www.gnu.org/licenses/lgpl-3.0.en.html). to > FLINT is a C library for...

I suppose this would be pretty easy to implement with the generic rings interface by Fredrik. Ping @fredrik-johansson

@kaelingre Have you looked into [Oscar.jl](https://github.com/oscar-system/Oscar.jl)? They support that specific field (not natively, however). There you should be able to do it by creating a parent object `R` of type...

I will just state it here as well: For inverses, I believe for small $n$ the fastest method is via Newton iteration (and based off of GMP, I suppose this...

> There is also the basecase algorithm used by `mpfr_divhigh_n_basecase` and the variant described here: https://inria.hal.science/hal-04557431v1/document I saw that one. I'm wondering how a fast `mpn_invert` joined with Granlund-Möller 2n-by-n...

As for the example, you also have to modify `dev/check_examples.sh`. See `Makefile` for how it is called. It should check that the example gives a correct output. Rigorousness is not...