Verifying whether extremely large integer guarantees Collatz conjecture (can return to 1 finally)

Currently, the largest integer being verified for Collatz conjecture is about 2^60 . To verify whether extremely large integers such as 2^{100000}-1 can return 1, we design a new algorithm. This dedicated algorithm can change numerical computation into bit or charter computation, hence, original dynamics for extremely large integer without upper bound can be computed. By this algorithm, we thus design computer program that can output original dynamics for extremely large integers without upper-bound such as 2^{100000}-1, which is the largest integer being verified until now. The source code is txpo15.c. The bit length of extremely large integer can be set up by Macro (named MAXLEN) in source code. The program can output the original dynamics (called CODE) of a starting integer in terms of “-” presenting (3*x+1)/2 and “0” presenting x/2. This data can be used for verifying whether extremely large number can go to 1 finally. Note that, there is no upper bound for extremely large starting integer; all is timing issue.