Where can I validate $300\ 000$ digit prime number is valid one? I recently found a different method to compute prime number in $\mathcal O(\log(\log n))$ complexity. At present, that logic working fine for $300$ digits prime number, which I found on websites.I need to validate whether that logic will be working fine for a higher number of digits. At present, I have computed a prime number of $300\ 000$ digits(but I am not sure whether this would be valid),
My questions are:


*

*Where can I find a prime number of higher digits i.e., more than
$300\ 000$ digits?

*Where can I validate $300\ 000$ digit prime number is valid one?


From what you write I understand that you want to prove that your method is fine. It probably is if you checked up to 300, digits. But the only way to validate a method is by analysing it step by step and actually prove that it works. No matter how many digits you try, that will not be a proof that your method has no flaws.
