collatz

The most fundamental properties the Collatz function shares with hash functions include it being deterministic and non-invertable.

My research primarily involves exploiting the computationally intensive aspects of the Collatz function (and its inverse) to construct cryptographic systems.

Upon further inspection the only real transformation they add to the Collatz function is returning the result modulo some prime.

They even had the nerve to include a generalization of the Collatz function in the patent.

Consider a program that searched for a counterexample to the Collatz conjecture, or the Riemann Hypothesis.

Is there some well-known property of Collatz sequences that make them suitable for crypto hashes?

The Rust loop version of collatz is also missing a semicolon and missing a!

My first C program forked a child, its child initiated a shared memory object, wrote a collatz sequence to it and exited.

There are also a lot of problems that could be proven or disproven via (counter)example - something like the Collatz conjecture, for instance.

I'd be more comfortable coding something more concrete and familiar than Collatz and Happy number sequences personally.

On a similar note, just write a program that runs the collatz conjecture and prints the result and a program that prints 1.

One might believe that the Collatz conjecture is true or false, but we certainly lack evidence for either case today.

To be "false" I'd have to have tangible evidence of "the Collatz conjecture is false", a counterexample.

So, "2 + 2" is true because I can generate tangible evidence of it, but "the Collatz conjecture" is not true because I cannot.

What I should have said a second ago is "The Collatz conjecture is not true (for me) (right now) (because I personally don't happen to have evidence for its validity yet)".