Can you use modular arithmetics exponencial property to make the calculus of the Mod (2^2^82589933-1,2^82589933-1) in many fragments ?
The problem you'd face is that the modulus has ~100 million bits. So the result could be in that ballpark. Maybe not insurmountable, but it would take substantial time and memory using PowerMod.
PowerMod
