v1 state

selfPath

selfPath is this realm's own page. A root-relative link resolves against the domain, not the realm, so every link back into it names it in full.

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.

MaxResults

MaxResults bounds the leaderboard's state: anyone may Compute, and each new n is a new entry the root page sorts.

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.

maxOdd

maxOdd is the largest odd term whose successor 3n+1 still fits in an int64. Past it the step wraps: 6148914691236517205 maps to exactly 2^64, which is 0, and the walk then spins on 0 until maxIters.

stopping

stopping returns the number of steps to reach 1 and the peak value seen, walking the Collatz (hailstone) map. ok is false when a term would overflow int64, in which case steps and peak describe the walk up to that term. 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