v0 state

maxIters

maxIters caps the Collatz walk so a hostile / huge input cannot loop forever on-chain. No known n stays below this bound and fails to reach 1.

maxSeqLen

maxSeqLen caps how many terms Render("/\<n>") will print.

Result

Result is one recorded submission.

results

results maps a decimal-string key of N -> Result. avl.Tree keeps a deterministic order for iteration inside Render.

stopping

stopping returns the number of steps to reach 1 and the peak value seen, walking the Collatz (hailstone) map. It never mutates state.

Compute

Compute walks the hailstone sequence for n and records the result attributed to the caller. It is a crossing (state-mutating) func.

byLongest

byLongest implements sort.Interface, ordering results by steps desc, then peak desc, then n asc for stability.

Render

Render shows the leaderboard at root, or the full hailstone sequence for a given n at path "/\<n>".

renderLeaderboard

renderSequence