> I have implemented the Zimmermann's square root algorithm, available in works
> [here](https://inria.hal.science/inria-00072854/en/) and
> [here](https://www.researchgate.net/publication/220532560_A_proof_of_GMP_square_root).
>
> The algorithm is proved to be asymptotically faster than the New
On Sun, 23 Jun 2024 10:52:13 GMT, Daniel Jeliński wrote:
>> @djelinski I'm referring to the tests of square root for BigIntegers.
>
> ah, so before your changes, the arguments were always normalized, and now
> they are not?
@djelinski Now I found the issue and resolved it normalizing the Zimmer
