well, currently the largest merrsine prime is 2^30,402,457 - 1, that digit is roughly 9,152,052 dec digits long. i am not wanting to waste 30k to store the smaller primes that can be stored in 128 bits. my ultimate goal is to win the prize money from eff [link]http://www.eff.org/awards/coop.php[/link]. while it is unlikely that i will achive that since i am doing this on my own, if i can learn to do this efficiantly, then i make myself more valuable for a job down the line. however, the only way that i have been able to figure out on how to do something like this, would be to create a variable sized array that would split the number up.

Code:

unsigned int sizeofarray;
... stuff to figureout how large the number acctually is...
unsigned int array[sizeofarray];

so if the number was say 2, then it would have an array of 1, if the number was say 2^128 -1, it would then have an array size of 4. and then write up the math functions as needed to work within these bounds. which would be a solution to making a dynamically sized variable. i just feal that there is a better answer to this.