About generate RSA large prime pairs.Not only is it slow, but it's hard to find really large prime numbers

[you74092078]

miracl *mip = mirsys(4096,16);
irand(mip, time(NULL)+SEED_CONST);
.......
do
{
seed = brand(mip);
bigbits(mip,half,btmp);
//otnum(mip,btmp, stdout);
nxprime(mip,btmp,bp);
p_width = numdig(mip, bp);
if(p_width != (bits/8))
{
continue;
}

		for (i=0; i<10; i++)
		{
			if (!isprime(mip, bp))
			{
				continue;
			}
		}
		
		break;
	} while (1);

	do 
	{
		seed = brand(mip);
		bigbits(mip,half,btmp);
		//otnum(mip,btmp, stdout);
		nxprime(mip,btmp,bq);

		if (compare(bp,bq)==0)
		{
			continue;
		}
		q_width = numdig(mip, bq);
		if(q_width != (bits/8))
		{
			continue;
		}

		for (i=0; i<10; i++)
		{
			if (!isprime(mip, bq))
			{
				continue;
			}
		}

		break;
	} while (1);