Publications

The Research behind Collatz Labs.

Research Preview July 2026

A Pseudorandom Number Generator from the Collatz One-Way Function, Under the Collatz Branching Hardness Assumption

Shaurya Pratap Singh — Department of Computer Science and Automation, Indian Institute of Science, Bengaluru

Constructs a PRNG whose security reduces entirely to the conjectured one-wayness of the Collatz function, via the HILL framework and a Goldreich–Levin hardcore bit — with a complete security proof under the stated assumption, an open-source C++ reference implementation, and an explicit discussion of the gap between the assumption and a formal proof.

HILL framework Goldreich–Levin hardcore bit open source conjectured hardness
Get Started

Read the research. Collatz Labs is doing.