# Convergence verification of the Collatz problem

The convergence of all numbers below 1838 × 2^{60} (≈ 2^{70.84}) has been verified. The work unit is 2^{40} numbers. On modern GPUs, verification of one work unit takes 10 seconds on average. All source codes are available on this GitHub repository.

## Progress towards verifying all numbers below 1839 × 2^{60}

Lowest incomplete: ` 50.1637 % `

(work unit ` 1927808693 × 2`

, all work units below are verified)^{40}

Lowest unassigned: ` 51.9096 % `

(work unit ` 1927827000 × 2`

, all work units below are assigned or even verified)^{40}