# Convergence verification of the Collatz problem

The convergence of all numbers below 1655 × 2^{60} (≈ 2^{70.69}) 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 1656 × 2^{60}

Lowest incomplete: ` 66.0138 % `

(work unit ` 1736085485 × 2`

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

Lowest unassigned: ` 66.2613 % `

(work unit ` 1736088080 × 2`

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