Hi, and belated congratulations! Are you by any chance planning to release your source after the ceremony? It'd be really interesting to read some peak-efficie

Hi, and belated congratulations! Are you by any chance planning to release your source after the ceremony? It'd be really interesting to read some peak-efficiency GMP code as that's a library I've always been interested in. Additionally, do you happen to know how much longer it could take to factor modulus n and then compute the value for 2^(2^t) using the methods described in the paper? i.e. instead of repeated squaring compute 2^(2^t mod phi(n)) mod n