https://gcc.gnu.org/bugzilla/show_bug.cgi?id=118499
--- Comment #22 from anlauf at gcc dot gnu.org --- (In reply to anlauf from comment #21) > When doing x ** n in unsigned binary arithmetic, and x is an unsigned with k > bits, and we do arithmetic modulo 2^k, then > > x ** n = x ** min (n, k) (mod 2^k) Scrap that, this is wrong.
