https://gcc.gnu.org/bugzilla/show_bug.cgi?id=97459
--- Comment #14 from Thomas Koenig <tkoenig at gcc dot gnu.org> --- Created attachment 49520 --> https://gcc.gnu.org/bugzilla/attachment.cgi?id=49520&action=edit Numbers a, b so that 2^b ≡ 1 mod a up to b=64, larger b taken if several solutions exist, plus the multiplicative inverse for 2^128 I've added the multiplicative inverse to the table, calculated with maxima by inv_mod(x,2^128). Output is in hex, to make it easier to break down into two numbers. Is there any more info that I could provide?
