The pattern
Starting with 6 gives 6 → 3 → 10 → 5 → 16 → 8 → 4 → 2 → 1.
→Can two elementary rules force every positive integer to reach the same small cycle?
Collatz is less about a future industry and more about building better AI-math, formal verification and distributed mathematical-compute infrastructure today.
The question
Understand it in two minutes
Starting with 6 gives 6 → 3 → 10 → 5 → 16 → 8 → 4 → 2 → 1. Some numbers fall quickly. Others rise far above their starting value before coming down. A counterexample could either grow without bound or enter a different cycle. Computers have checked an enormous finite range, and deep theorems describe the behavior of almost all starting values in specific density senses. Neither result covers every positive integer.
Starting with 6 gives 6 → 3 → 10 → 5 → 16 → 8 → 4 → 2 → 1.
→Some numbers fall quickly. Others rise far above their starting value before coming down. A counterexample could either grow without bound or enter a different cycle.
→Computers have checked an enormous finite range, and deep theorems describe the behavior of almost all starting values in specific density senses. Neither result covers every positive integer.
The problem studies repeated integer maps, cycles, growth and the boundary between deterministic structure and probabilistic behavior.
Its vast computational support makes it a clean lesson in why finite verification is not a universal proof.
Efficient verification, distributed computing, exact arithmetic and proof assistants all use it as a demanding test case.
Possibilities
What it could unlock
These are evidence-labeled possibilities, not predictions.
Run large mathematical searches with deterministic jobs, auditable provenance and independently checkable output certificates.
Why it connects: Distributed verification has checked all Collatz starts below 2^71.
See the possibility →Evaluate proof agents on source-linked research statements, known partial results, false-proof traps and machine-checkable subgoals.
Why it connects: Collatz offers finite certificates and graded partial statements.
See the possibility →Ideas
Ideas it inspires
Idea seeds for curiosity—not instructions or promises.
Package finite mathematical searches as deterministic jobs with exact versions, logs, checkpoints and independently checkable certificates.
Yes; Collatz and zeta-zero verification provide concrete starting examples.
A graded benchmark of formal statements, known lemmas, finite certificates, dependency retrieval and adversarial false-proof traps.
Yes, using existing Lean repositories and source-backed partial results.